A triangle-free circle graph with chromatic number 5
暂无分享,去创建一个
Abstract It follows from the results of Karapetyan (1984), Gyarfas and Lehel (1985), and Kostochka (1988) that 4⩽χ* ⩽5 where χ* = max{χ(G): G is a triangle-free circle graph. We show that χ* ⩾ 5 and thus χ* = 5. This disproves the conjecture of Karapetyan that 4 ≤ χ * ≤ 5 and answers negatively a question of Gyarfas and Lehel.
[1] Tommy R. Jensen,et al. Graph Coloring Problems , 1994 .
[2] András Gyárfás,et al. Covering and coloring problems for relatives of intervals , 1985, Discret. Math..
[3] Alexandr V. Kostochka,et al. Covering and coloring polygon-circle graphs , 1997, Discret. Math..
[4] András Gyárfás,et al. On the chromatic number of multiple interval graphs and overlap graphs , 1985, Discret. Math..