Abstract
Let denote the chromatic number of a graph and denote the vector chromatic number. For all graphs and for some graphs . Galtman proved that Hoffman's well-known lower bound for is in fact a lower bound for . We prove that two more spectral lower bounds for are also lower bounds for . We then use one of these bounds to derive a new characterization of .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.