Mathematics – Combinatorics
Scientific paper
2008-07-21
Mathematics
Combinatorics
29 pages, also available at http://www.cdam.lse.ac.uk/Reports/Files/cdam-2008-09.pdf
Scientific paper
In 1977, Wegner conjectured that the chromatic number of the square of every
planar graph $G$ with maximum degree $\Delta\ge8$ is at most $\lfloor\frac32
\Delta\bigr+1$. We show that it is at most $\frac32 \Delta (1+o(1))$, and
indeed this is true for the list chromatic number and for more general classes
of graphs.
den Heuvel Jan van
Havet Frédéric
McDiarmid Colin
Reed Bruce
No associations
LandOfFree
List Colouring Squares of Planar Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with List Colouring Squares of Planar Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and List Colouring Squares of Planar Graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-71806