3 papers
math.CO2025
Open problems of the 33rd Workshop on Cycles and Colourings
János Barát, Zdeněk Dvořák, Penny Haxell +6
Since its beginnings, every Cycles and Colourings workshop holds one or two open problem sessions; this document contains the problems (together with notes regarding the current st…
math.CO2024
Strictly critical snarks with girth or cyclic connectivity equal to 6
Ján Mazák, Jozef Rajník, Martin Škoviera
A snark -- connected cubic graph with chromatic index -- is critical if the graph resulting from the removal of any pair of distinct adjacent vertices is -edge-colourable; i…
cs.DM2021
Morphology of small snarks
Ján Mazák, Jozef Rajník, Martin Škoviera
The aim of this paper is to classify all snarks up to order and explain the reasons of their uncolourability. The crucial part of our approach is a computer-assisted structura…