Borodin–Kostochka–Woodall List Total Coloring Conjecture
Let be a graph, and let be its total graph, whose vertices are the vertices and edges of , with adjacency given by adjacency, incidence, or edge adjacency in . The source also writes . Write for chromatic number and for list chromatic number. Borodin–Kostochka–Woodall List Total Coloring Conjecture. Every graph satisfies
References
2 papers in this index state this conjecture (2013–2022). The statement above is taken from the most recent of them; the others are arXiv:1305.2566.
Status
- Refuted: the author(s) of the arXiv preprint. The List Total Coloring Conjecture is False (arXiv preprint, 2026) https://arxiv.org/html/2609.38417
Source: Morteza Hasanvand, “The List Square Coloring Conjecture fails for bipartite planar graphs and their line graphs”, arXiv:2211.00622 (2025).
Progress summary
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.