14 citations · 26 across the 9 of their papers we have counts for
1 paper · 1 filter
Aida Abiad, Wieb Bosma, Thijs van Veluw
Hoffman's bound is a well-known spectral bound on the chromatic number of a graph, known to be tight for instance for bipartite graphs. While Hoffman colorings (colorings attaining…