List Colouring Squares of Planar Graphs
read the original abstract
In 1977, Wegner conjectured that the chromatic number of the square of every planar graph $G$ with maximum degree $\Delta\ge8$ is at most $\bigl\lfloor\frac32\Delta\bigr\rfloor+1$. We show that it is at most $\frac32 \Delta (1+o(1))$ (where the $o(1)$ is as $\Delta\to+\infty$), and indeed that this is true for the list chromatic number and for more general classes of graphs.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Coloring powers of random graphs
For p = d/n the r-th power has maximum degree ~ log n over (r+1)-fold log and chromatic number sandwiched between the maximum degrees of the floor(r/2) and (r-1) powers plus one (equality at r=2); for d = omega(log n)...
-
Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)
This is a survey compiling results on strong edge-coloring and related coloring problems for squares of graphs in planar and sparse classes.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.