Coverings of Cubic Graphs and 3-Edge Colorability

Let h:G˜→Gh:\tilde G \to G be a finite covering of 2-connected cubic (multi)graphs where G is 3-edge uncolorable. In this paper, we describe conditions under which G˜\tilde G is 3-edge uncolorable. As particular cases, we have constructed regular and irregular 5-fold coverings f:G˜→Gf:\tilde G...

Full description

Bibliographic Details
Main Author: Plachta Leonid
Format: Article
Language:English
Published: Sciendo 2021-02-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
Online Access:https://doi.org/10.7151/dmgt.2194