22 citations · 92 across the 73 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.CO2014
Planar graphs are 9/2-colorable
Daniel W. Cranston, Landon Rabern
We show that every planar graph has a 2-fold 9-coloring. In particular, this implies that has fractional chromatic number at most . This is the first proof (indepe…
math.CO2014
A note on coloring vertex-transitive graphs
Daniel W. Cranston, Landon Rabern
We prove bounds on the chromatic number of a vertex-transitive graph in terms of its clique number and maximum degree . We conjecture that every vertex-transitive graph…
math.CO2014★ 2 cited
Brooks' Theorem and Beyond
Daniel W. Cranston, Landon Rabern
We collect some of our favorite proofs of Brooks' Theorem, highlighting advantages and extensions of each. The proofs illustrate some of the major techniques in graph coloring, suc…