1. Normal 5-edge-colorings of a family of Loupekhine snarks
- Author
-
Luca Ferrarini, Giuseppe Mazzuoccolo, and Vahan Mkrtchyan
- Subjects
cubic graph ,petersen coloring conjecture ,normal edge-coloring ,class of snarks ,Mathematics ,QA1-939 - Abstract
In a proper edge-coloring of a cubic graph an edge uv is called poor or rich, if the set of colors of the edges incident to u and v contains exactly three or five colors, respectively. An edge-coloring of a graph is normal, if any edge of the graph is either poor or rich. In this note, we show that some snarks constructed by using a method introduced by Loupekhine admit a normal edge-coloring with five colors. The existence of a Berge-Fulkerson Covering for a part of the snarks considered in this paper was recently proved by Manuel and Shanthi (2015). Since the existence of a normal edge-coloring with five colors implies the existence of a Berge-Fulkerson Covering, our main theorem can be viewed as a generalization of their result.
- Published
- 2020
- Full Text
- View/download PDF