List precoloring extension in planar graphs

Details List precoloring extension in planar graphs List precoloring extension in planar graphs

2010-06-29

arxiv.org/abs/1006.5596v2

Mathematics

Combinatorics

v2: 15 pages, 11 figres, corrected typos and new proof of Theorem 3(2)

Scientific paper

10.1016/j.disc.2011.03.007

A celebrated result of Thomassen states that not only can every planar graph be colored properly with five colors, but no matter how arbitrary palettes of five colors are assigned to vertices, one can choose a color from the corresponding palette for each vertex so that the resulting coloring is proper. This result is referred to as 5-choosability of planar graphs. Albertson asked whether Thomassen's theorem can be extended by precoloring some vertices which are at a large enough distance apart in a graph. Here, among others, we answer the question in the case when the graph does not contain short cycles separating precolored vertices and when there is a "wide" Steiner tree containing all the precolored vertices.

Affiliated with

Also associated with

No associations

Rating

List precoloring extension in 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 precoloring extension in planar graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and List precoloring extension in planar graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-314604