| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657470 | Journal of Combinatorial Theory, Series B | 2006 | 6 Pages |
Abstract
Hoffman's bound on the chromatic number of a graph states that χ⩾1−λ1/λn. Here we show that the same bound, or slight modifications of it, hold for several graph parameters related to the chromatic number: the vector coloring number, the ψ-covering number and the λ-clustering number.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
