Back to Search
Start Over
Eigenvalues and colorings of digraphs
- Source :
-
Linear Algebra & its Applications . Apr2010, Vol. 432 Issue 9, p2273-2277. 5p. - Publication Year :
- 2010
-
Abstract
- 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. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 00243795
- Volume :
- 432
- Issue :
- 9
- Database :
- Academic Search Index
- Journal :
- Linear Algebra & its Applications
- Publication Type :
- Academic Journal
- Accession number :
- 48406770
- Full Text :
- https://doi.org/10.1016/j.laa.2009.05.027