A Brooks' Theorem for Triangle-Free Graphs

Details A Brooks' Theorem for Triangle-Free Graphs A Brooks' Theorem for Triangle-Free Graphs

2011-06-10

arxiv.org/abs/1106.1958v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Brooks' Theorem for Triangle-Free Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Brooks' Theorem for Triangle-Free Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Brooks' Theorem for Triangle-Free Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-319830