Cubic Graphs with Colouring Defect 3

• Published in: The Electronic journal of combinatorics Vol. 31; no. 2
• Main Authors: Karabáš, Ján, Máčajová, Edita, Nedela, Roman, Škoviera, Martin
• Format: Journal Article
• Language: English
• Published: 05.04.2024
• ISSN: 1077-8926; 1077-8926
• DOI: 10.37236/12333

The colouring defect of a cubic graph is the smallest number of edges left uncovered by any set of three perfect matchings. While $3$-edge-colourable graphs have defect $0$, those that cannot be $3$-edge-coloured (that is, snarks) are known to have defect at least $3$. In this paper we focus on the structure and properties of snarks with defect $3$. For such snarks we develop a theory of reductions similar to standard reductions of short cycles and small cuts in general snarks. We prove that every snark with defect $3$ can be reduced to a snark with defect $3$ which is either nontrivial (cyclically $4$-edge-connected and of girth at least $5$) or to one that arises from a nontrivial snark of defect greater than $3$ by inflating a vertex lying on a suitable $5$-cycle to a triangle. The proofs rely on a detailed analysis of Fano flows associated with triples of perfect matchings leaving exactly three uncovered edges. In the final part of the paper we discuss application of our results to the conjectures of Berge and Fulkerson, which provide the main motivation for our research.