List Colouring Squares of Planar Graphs

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-71806

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.