Coloring and The Lonely Graph

Preprint English OPEN
Rabern, Landon;
(2007)
  • Subject: Mathematics - Combinatorics | 05C15

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 completely joined. Using this, we prove that if a graph has an optimal coloring with more th... View more
Share - Bookmark