论文信息 - Coloring claw-free graphs with − 1 colors - 字舞流文

Coloring claw-free graphs with − 1 colors

We prove that every claw-free graph G that doesn’t contain a clique on ( G) 9 vertices can be ( G) 1 colored.

Daniel W. Cranston | Landon Rabern | Landon Rabern | D. Cranston

[1] Hal A. Kierstead,et al. The chromatic number of graphs which induce neither K1, 3 nor K5-e , 1986, Discret. Math..

[2] Andrew D. King,et al. Bounding χ in terms of ω and Δ for quasi-line graphs , 2008 .

[3] B. Reed. Graph Colouring and the Probabilistic Method , 2001 .

[4] Landon Rabern,et al. Conjectures equivalent to the Borodin-Kostochka Conjecture that are a priori weaker , 2012 .

[5] Alexandr V. Kostochka,et al. List Edge and List Total Colourings of Multigraphs , 1997, J. Comb. Theory B.

[6] Sylvain Gravier,et al. Graphs whose choice number is equal to their chromatic number , 1998 .

[7] Maria Chudnovsky,et al. Coloring quasi-line graphs , 2007 .

[8] R. L. Brooks. On Colouring the Nodes of a Network , 1941 .

[9] Alexandr V. Kostochka,et al. On an upper bound of a graph's chromatic number, depending on the graph's degree and density , 1977, J. Comb. Theory B.

[10] Landon Rabern. A Strengthening of Brooks' Theorem for Line Graphs , 2011, Electron. J. Comb..

[11] Bruce A. Reed,et al. A Strengthening of Brooks' Theorem , 1999, J. Comb. Theory B.

[12] Paul D. Seymour,et al. The structure of claw-free graphs , 2005, BCC.

[13] Medha Dhurandhar. Improvement on Brooks' chromatic bound for a class of graphs , 1982, Discret. Math..