On Brooks' Theorem for Sparse Graphs
1995 ◽
Vol 4
(2)
◽
pp. 97-132
◽
Let G be a graph with maximum degree Δ(G). In this paper we prove that if the girth g(G) of G is greater than 4 then its chromatic number, χ(G), satisfieswhere o(l) goes to zero as Δ(G) goes to infinity. (Our logarithms are base e.) More generally, we prove the same bound for the list-chromatic (or choice) number:provided g(G) < 4.
1986 ◽
Vol 100
(2)
◽
pp. 303-317
◽
Keyword(s):
2002 ◽
Vol 11
(1)
◽
pp. 103-111
◽
2018 ◽
Vol 10
(04)
◽
pp. 1850045
Keyword(s):
Keyword(s):
1970 ◽
Vol 22
(5)
◽
pp. 1082-1096
◽