List-colouring extension of Wegner's conjecture for nice graph families

At least 17 years old · documented by

Let F\mathcal{F} be a nice family of graphs, and let G∈FG\in\mathcal{F} have maximum degree Δ(G)\Delta(G) sufficiently large.

List-colouring extension of Wegner's conjecture.

χ(G2)≤ch(G2)≤⌊32 Δ(G)⌋+1.\chi(G^2)\le\mathit{ch}(G^2)\le\left\lfloor\frac32\,\Delta(G)\right\rfloor+1.

The source notes that this is true for the family of K4K_4-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.

References

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

No solutions have been posted yet.