Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable

被引:5
作者
Chudnovsky, Maria [1 ]
Liu, Chun-Hung [1 ,7 ]
Schaudt, Oliver [2 ]
Spirkl, Sophie [1 ,6 ]
Trotignon, Nicolas [3 ]
Vuskovic, Kristina [4 ,5 ]
机构
[1] Princeton Univ, Program Appl & Computat Math, Princeton, NJ 08544 USA
[2] Univ Cologne, Cologne, Germany
[3] Univ Lyon, ENS Lyon, Inst Informat, CNRS,LIP, Lyon, France
[4] Univ Leeds, Sch Comp, Leeds, W Yorkshire, England
[5] Union Univ, Fac Comp Sci, Belgrade, Serbia
[6] Rutgers State Univ, Dept Math, Hill Ctr, Busch Campus,110 Frelinghuysen Rd, Piscataway, NJ 08854 USA
[7] Texas A&M Univ, Dept Math, Mailstop 3368, College Stn, TX 77843 USA
基金
英国工程与自然科学研究理事会;
关键词
coloring; induced subgraph; CHROMATIC NUMBER;
D O I
10.1002/jgt.22441
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We show that triangle-free graphs that do not contain an induced subgraph isomorphic to a subdivision of K-4 are 3-colorable. This proves a conjecture of Trotignon and Vuskovic [J. Graph Theory. 84 (2017), no. 3, pp. 233-248].
引用
收藏
页码:67 / 95
页数:29
相关论文
共 17 条