List-colouring extension of Wegner's conjecture for nice graph families
List-colouring extension of Wegner's conjecture for nice graph families
Let be a nice family of graphs, and let have maximum degree sufficiently large.
List-colouring extension of Wegner's conjecture.
The source notes that this is true for the family of -minor-free graphs, by results of Lih, Wang and Zhu and of Hetherington and Woodall. The conjecture remains open for general nice families in the source.
Sources & referencesView supporting material
Primary source
Frédéric Havet, Jan van den Heuvel, Colin McDiarmid and Bruce Reed, “List Colouring Squares of Planar Graphs”, arXiv:0807.3233 (2017).
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
Sign in to submit a solution.
No solutions have been posted yet.