Coloring and The Lonely Graph
Rabern, Landon;
- 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
- References (6)
- Similar Research Results (4) publicationOn the tree cover number and the positive semidefinite maximum nullity of a graph (2018)80%publicationOptimal pebbling number of the square grid (2018)80%publicationOn graph identification problems and the special case of identifying vertices using paths (2012)80%publicationComplete graph immersions in dense graphs (2015)79%
- Metrics
Share - Bookmark
- Download from