Überblick

Open Access

• true

Peer Reviewed

• true

Abstract

• 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.

authors

• Czap, Július
• Jendro?, Stanislav
• Margit Voigt

Veröffentlichungszeitpunkt

• Januar 1, 2018

veröffentlicht in

• Rocznik Akademii Górniczo-Hutniczej im. Stanisława Staszica. Opuscula Mathematica, Vol.38(6), pp. 819-827  Zeitschrift