Thomassen's finiteness conjecture for 5-list-critical graphs on surfaces
Let be a surface, and let be a graph embedded in . A list assignment assigns a set of colors to each vertex; is -critical if it has no -coloring but every proper subgraph of has an -coloring. Thomassen's conjecture. For every surface there are, up to isomorphism, only finitely many graphs such that embeds in and is -critical for some -list assignment .
References
Status
- Solved: Ken-ichi Kawarabayashi and Bojan Mohar. List-Color-Critical Graphs on a Fixed Surface (ACM-SIAM Symposium on Discrete Algorithms (SODA), 2009) https://doi.org/10.1137/1.9781611973068.125
Source: Luke Postle and Robin Thomas, “Hyperbolic families and coloring graphs on surfaces”, arXiv:1609.06749 (2018).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.