Coloring plane graphs with independent crossings

Details Coloring plane graphs with independent crossings Coloring plane graphs with independent crossings

2008-11-17

arxiv.org/abs/0811.2702v1

Mathematics

Combinatorics

Scientific paper

We show that every plane graph with maximum face size four whose all faces of
size four are vertex-disjoint is cyclically 5-colorable. This answers a
question of Albertson whether graphs drawn in the plane with all crossings
independent are 5-colorable.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-466806