4 citations · 20 across the 30 of their papers we have counts for
Showing 2007Show all
2 papers · 1 filter
math.CO2007
At Least Half Of All Graphs Satisfy χ\leq {1/4}ω+ {3/4}Δ+ 1
Landon Rabern
We prove that for any graph G at least one of G or satisfies . In particular, self-complementary graphs satisfy this bound.
math.CO2007★ 2 cited
Coloring and The Lonely Graph
Landon Rabern
We improve upper bounds on the chromatic number proven independently in \cite{reedNote} and \cite{ingo}. Our main lemma gives a sufficient condition for two paths in graph to be co…