Normal 5-edge-colorings of a family of Loupekhine snarks

04/04/2019
by   Luca Ferrarini, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/13/2019

Normal 6-edge-colorings of some bridgeless cubic graphs

In an edge-coloring of a cubic graph, an edge is poor or rich, if the se...
research
04/25/2018

Normal edge-colorings of cubic graphs

A normal k-edge-coloring of a cubic graph is an edge-coloring with k col...
research
04/19/2021

On sublinear approximations for the Petersen coloring conjecture

If f:ℕ→ℕ is a function, then let us say that f is sublinear if lim_...
research
07/17/2018

On maximum k-edge-colorable subgraphs of bipartite graphs

If k≥ 0, then a k-edge-coloring of a graph G is an assignment of colors ...
research
10/05/2018

Improved Inapproximability of Rainbow Coloring

A rainbow q-coloring of a k-uniform hypergraph is a q-coloring of the ve...
research
06/30/2023

Borel Vizing's Theorem for Graphs of Subexponential Growth

We show that every Borel graph G of subexponential growth has a Borel pr...
research
03/25/2020

On the Classification of Motions of Paradoxically Movable Graphs

Edge lengths of a graph are called flexible if there exist infinitely ma...

Please sign up or login with your details

Forgot password? Click here to reset