A Brooks' Theorem for Triangle-Free Graphs
Combinatorics
2011-06-13 v1 Discrete Mathematics
Abstract
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.
Keywords
Cite
@article{arxiv.1106.1958,
title = {A Brooks' Theorem for Triangle-Free Graphs},
author = {Mohammad Shoaib Jamall},
journal= {arXiv preprint arXiv:1106.1958},
year = {2011}
}