5-choosability of graphs with 2 crossings

Details 5-choosability of graphs with 2 crossings 5-choosability of graphs with 2 crossings

2011-05-13

arxiv.org/abs/1105.2723v1

Mathematics

Combinatorics

Scientific paper

We show that every graph with two crossings is 5-choosable. We also prove
that every graph which can be made planar by removing one edge is 5-choosable.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-27558