Morphology of small snarks

12/08/2021
by   Ján Mazák, et al.
0

The aim of this paper is to classify all snarks up to order 36 and explain the reasons of their uncolourability. The crucial part of our approach is a computer-assisted structural analysis of cyclically 5-connected critical snarks, which is justified by the fact that every other snark can be constructed from them by a series of simple operations while preserving uncolourability. Our results reveal that most of the analysed snarks are built up from pieces of the Petersen graph and can be naturally distributed into a small number of classes having the same reason for uncolourability. This sheds new light on the structure of all small snarks. Based on our analysis, we generalise certain individual snarks to infinite families and identify a rich family of cyclically 5-connected critical snarks.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/30/2019

The smallest nontrivial snarks of oddness 4

The oddness of a cubic graph is the smallest number of odd circuits in a...
research
06/06/2023

Infinite families of k-vertex-critical (P_5, C_5)-free graphs

A graph is k-vertex-critical if χ(G)=k but χ(G-v)<k for all v∈ V(G). We ...
research
11/27/2019

Words With Few Palindromes, Revisited

In 2013, Fici and Zamboni proved a number of theorems about finite and i...
research
05/18/2021

Two new infinite classes of APN functions

In this paper, we present two new infinite classes of APN functions over...
research
03/17/2021

Locality of Random Digraphs on Expanders

We study random digraphs on sequences of expanders with bounded average ...
research
10/20/2020

Algebraic Structures from Concurrent Constraint Programming Calculi for Distributed Information in Multi-Agent Systems

Spatial constraint systems (scs) are semantic structures for reasoning a...

Please sign up or login with your details

Forgot password? Click here to reset