A Note on Altermatic Number
From MaRDI portal
Abstract: In view of Tucker's lemma (an equivalent combinatorial version of the Borsuk- Ulam theorem), the present authors (2013) introduced the kth altermatic number of a graph G as a tight lower bound for the chromatic number of G. In this note, we present a purely combinatorial proof for this result.
This page was built for publication: A Note on Altermatic Number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6266707)
