On the 4-color theorem for signed graphs

被引:13
|
作者
Kardos, Frantisek [1 ]
Narboni, Jonathan [1 ]
机构
[1] Univ Bordeaux, LaBRI, Bordeaux INP, UMR 5800,CNRS, F-33400 Talence, France
关键词
D O I
10.1016/j.ejc.2020.103215
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Macajova et al. (2016) defined the chromatic number of a signed graph which coincides for all-positive signed graphs with the chromatic number of unsigned graphs. They conjectured that in this setting, for signed planar graphs four colors are always enough, generalizing thereby The Four Color Theorem. We disprove the conjecture. (C) 2020 Published by Elsevier Ltd.
引用
收藏
页数:8
相关论文
共 50 条