Graphs with two crossings are 5-choosable

Details Graphs with two crossings are 5-choosable Graphs with two crossings are 5-choosable

2011-03-09

arxiv.org/abs/1103.1801v1

Mathematics

Combinatorics

12 pages, 4 figures

Scientific paper

A graph G is k-choosable if G can be properly colored whenever every vertex
has a list of at least k available colors. Thomassen's theorem states that
every planar graph is 5-choosable. We extend the result by showing that every
graph with at most two crossings is 5-choosable.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-644670