3-facial colouring of plane graphs

Details 3-facial colouring of plane graphs 3-facial colouring of plane graphs

2006-07-03

arxiv.org/abs/cs/0607008v1

Computer Science

Discrete Mathematics

Scientific paper

A plane graph is l-facially k-colourable if its vertices can be coloured with k colours such that any two distinct vertices on a facial segment of length at most l are coloured differently. We prove that every plane graph is 3-facially 11-colourable. As a consequence, we derive that every 2-connected plane graph with maximum face-size at most 7 is cyclically 11-colourable. These two bounds are for one off from those that are proposed by the (3l+1)-Conjecture and the Cyclic Conjecture.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-415568