Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4601832 | Linear Algebra and its Applications | 2010 | 5 Pages |
Abstract
Wilf’s eigenvalue upper bound on the chromatic number is extended to the setting of digraphs. The proof uses a generalization of Brooks’ Theorem to digraph colorings.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory