5-choosability of graphs with crossings far apart

Details 5-choosability of graphs with crossings far apart 5-choosability of graphs with crossings far apart

2012-01-14

arxiv.org/abs/1201.3014v1

Mathematics

Combinatorics

47 pages, 11 figures

Scientific paper

We give a new proof of the fact that every planar graph is 5-choosable, and
use it to show that every graph drawn in the plane so that the distance between
every pair of crossings is at least 15 is 5-choosable. At the same time we may
allow some vertices to have lists of size four only, as long as they are far
apart and far from the crossings.

Affiliated with

Also associated with

No associations

Rating

5-choosability of graphs with crossings far apart 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 5-choosability of graphs with crossings far apart, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and 5-choosability of graphs with crossings far apart will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-694001