For regular graphs G, h(G)h(complement G) ≤ n, with equality exactly when G is strongly regular; Hoffman colorability forces pseudo-geometricity and finiteness.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Hoffman colorability of (strongly) regular graphs
For regular graphs G, h(G)h(complement G) ≤ n, with equality exactly when G is strongly regular; Hoffman colorability forces pseudo-geometricity and finiteness.