3-facial Colouring of Plane Graphs

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.

[1]  Yue Zhao,et al.  On cyclic colorings and their generalizations , 1999, Discret. Math..

[2]  Yue Zhao,et al.  On -Diagonal Colorings of Embedded Graphs of Low Maximum Face Size , 1998, Graphs Comb..

[3]  Daniel Král,et al.  Cyclic, diagonal and facial colorings - a missing case , 2007, Eur. J. Comb..

[4]  Yue Zhao,et al.  On d-diagonal colorings , 1996, J. Graph Theory.

[5]  Carsten Thomassen,et al.  Color-Critical Graphs on a Fixed Surface , 1997, J. Comb. Theory, Ser. B.

[6]  K. Appel,et al.  Every Planar Map Is Four Colorable , 2019, Mathematical Solitaires & Games.

[7]  Mirko Horňák,et al.  On some properties of 4-regular plane graphs , 1995, J. Graph Theory.

[8]  Oleg V. Borodin.  A new proof of the 6 color theorem , 1995, J. Graph Theory.

[9]  Daniel Král,et al.  Cyclic, diagonal and facial colorings , 2005, Eur. J. Comb..

[10]  Martin Tancer,et al.  List-Coloring Squares of Sparse Subcubic Graphs , 2008, SIAM J. Discret. Math..

[11]  Oleg V. Borodin.  Cyclic coloring of plane graphs , 1992, Discret. Math..

[12]  Yue Zhao,et al.  A New Bound on the Cyclic Chromatic Number , 2001, J. Comb. Theory, Ser. B.