Eigenvalues and colorings of digraphs

By Bojan Mohar. 2010

56 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/f88928335712b1ad430794be65a5220a7e02e3c0

Citations in the corpus

• A new kind of Hermitian matrices for digraphs (2019, unknown): “A well-known theorem of Wilf [16] bounding the chromatic number in terms of its largest eigenvalue extends to this setting as shown in [11].”