A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\)
From MaRDI portal
(Redirected from A sharp lower bound on the number of non-equivalent colorings of graphs of order n and maximum degree n - 3)
A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\)
A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\)
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.
