Kempe Equivalent List Colorings Revisited
From MaRDI portal
Abstract: A classical theorem of Gallai states that in every graph that is critical for -colorings, the vertices of degree induce a tree-like graph whose blocks are either complete graphs or cycles of odd length. Borodin and, independently, ErdH{o}s et al. provided a well-known generalization of Gallai's Theorem to list colorings, where the list at each vertex has the same number of available colors as the degree of that vertex. In this paper, we obtain an analogous result for Kempe equivalence of list colorings, partially resolving a problem of Cranston and Mahmoud.
This page was built for publication: Kempe Equivalent List Colorings Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6507187)
