arXiv Analytics

Sign in

arXiv:1106.1958 [math.CO]AbstractReferencesReviewsResources

A Brooks' Theorem for Triangle-Free Graphs

Mohammad Shoaib Jamall

Published 2011-06-10Version 1

Let G be a triangle-free graph with maximum degree \delta(G). We show that the chromatic number \c{hi}(G) is less than 67(1 + o(1))\delta/ log \delta.

Categories: math.CO, cs.DM
Related articles: Most relevant | Search more
arXiv:1210.7844 [math.CO] (Published 2012-10-29, updated 2014-10-29)
Unified spectral bounds on the chromatic number
arXiv:math/0511343 [math.CO] (Published 2005-11-14, updated 2008-12-17)
Random regular graphs of non-constant degree: Concentration of the chromatic number
arXiv:math/0507110 [math.CO] (Published 2005-07-06, updated 2007-09-14)
The chromatic numbers of double coverings of a graph

Links

Toolbox