No Detail Found!

Odd facial total-coloring of unicyclic plane graphs

Author(s)
Julius Czap Department of Applied Mathematics and Business Informatics, Faculty of Economics, Technical University of Kosˇice,Kosˇice,Slovakia
Abstract
A facial total-coloring of a plane graph G is a coloring of the vertices and edges such that no facially adjacent edges (edges that are consecutive on the boundary walk of a face of G), no adjacent vertices, and no edge and its endvertices are assigned the same color. A facial total-coloring of G is odd if for every face f and every color c, either no element or an odd number of elements incident with f is colored by c. In this paper, it is proved that every unicyclic plane graph admits an odd facial total-coloring with at most 10 colors. It is also shown that this bound is tight.
Publication Details
Page(s) 56-59
Published Journal: Discrete Mathematics Letters, Volume: 10, Issue: 0, Year: 2022

Request the full text from PASTIC

Keywords
plane graph, facial coloring, odd facial coloring
0

Citations

0

Downloads

35

Views