Zig-zag facial total-coloring of plane graphs

In this paper we introduce the concept of zig-zag facial total-coloring of plane graphs. We obtain lower and upper bounds for the minimum number of colors which is necessary for such a coloring. Moreover, we give several sharpness examples and formulate some open problems.

[1]  Stanislav Jendrol',et al.  Facially-constrained colorings of plane graphs: A survey , 2017, Discret. Math..

[2]  Stanislav Jendrol',et al.  Facial entire colouring of plane graphs , 2016, Discret. Math..

[3]  Július Czap,et al.  FACIAL TOTAL-COLORING OF BIPARTITE PLANE GRAPHS , 2017 .

[4]  Stanislav Jendrol',et al.  Facial list colourings of plane graphs , 2016, Discret. Math..

[5]  Kenneth Appel,et al.  The Four-Color Problem , 1978 .

[6]  Frank Harary,et al.  Graph Theory , 2016 .

[7]  T. L. Saaty,et al.  The four-color problem: Assaults and conquest , 1977 .

[8]  R. L. Brooks.  On colouring the nodes of a network , 1941, Mathematical Proceedings of the Cambridge Philosophical Society.

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

[10]  Sergey Kitaev,et al.  Patterns in Permutations and Words , 2011, Monographs in Theoretical Computer Science. An EATCS Series.