Vizing–Gupta–Albertson–Collins–Bollobás–Harris line-graph List Coloring Conjecture
Let be a graph and let be its line graph, whose vertices are the edges of , with two vertices adjacent when the corresponding edges share an endpoint. Write for chromatic number and for list chromatic number. Line-graph List Coloring Conjecture. Every graph satisfies
The source notes that this conjecture is proved for bipartite graphs, while its general status is not resolved in the supplied material.
References
- 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.