Cyclic colorings of plane graphs with independent faces

Details Cyclic colorings of plane graphs with independent faces Cyclic colorings of plane graphs with independent faces

2008-11-17

arxiv.org/abs/0811.2704v1

Mathematics

Combinatorics

Scientific paper

Let G be a plane graph with maximum face size D. If all faces of G with size
four or more are vertex disjoint, then G has a cyclic coloring with D+1 colors,
i.e., a coloring such that all vertices incident with the same face receive
distinct colors.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-466813