Graphs that contain a K1,2,3 and no induced subdivision of K4 are 4-colorable
Rong Chen
所有作者
Rong Chen
文献摘要
In 2012, Lévêque, Maffray, and Trotignon conjectured that each graph G that contains no induced subdivision of K4 is 4-colorable. In this paper, we prove that this conjecture holds when G contains a K1,2,3.