← All problems

Borodin–Kostochka–Woodall List Total Coloring Conjecture

13 years old · traced to

Let GG be a graph, and let T(G)T(G) be its total graph, whose vertices are the vertices and edges of GG, with adjacency given by adjacency, incidence, or edge adjacency in GG. The source also writes T(G)=B(G)2T(G)=B(G)^2. Write χ\chi for chromatic number and χℓ\chi_\ell for list chromatic number. Borodin–Kostochka–Woodall List Total Coloring Conjecture. Every graph GG satisfies

χ(T(G))=χℓ(T(G)).\chi(T(G))=\chi_\ell(T(G)).
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

Source: Morteza Hasanvand, “The List Square Coloring Conjecture fails for bipartite planar graphs and their line graphs”, arXiv:2211.00622 (2025).

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.