The smallest nontrivial snarks of oddness 4
From MaRDI portal
Publication:2306590
DOI10.1016/j.dam.2019.09.020zbMath1435.05075arXiv1901.10911OpenAlexW2980526064MaRDI QIDQ2306590
Edita Máčajová, Jan Goedgebeur, Martin Škoviera
Publication date: 23 March 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.10911
Related Items
Decomposition of cubic graphs with cyclic connectivity 5 ⋮ Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On snarks that are far from being 3-edge colorable
- Generation and properties of snarks
- Intersecting 1-factors and nowhere-zero 5-flows
- Measures of edge-uncolorability of cubic graphs
- On embeddings of snarks in the torus
- Classification and characterizations of snarks
- Oddness to resistance ratios in cubic graphs
- Weak oddness as an approximation of oddness and resistance in cubic graphs
- On the smallest snarks with oddness 4 and connectivity 2
- House of Graphs: a database of interesting graphs
- Double covers of cubic graphs with oddness 4
- Measurements of edge-uncolorability
- Five cycle double covers of some cubic graphs
- Small snarks with large oddness
- Petersen Cores and the Oddness of Cubic Graphs
- The genus of Petersen powers
- Cubic Graphs with Large Circumference Deficit
- Minimal Cyclic-4-Connected Graphs
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- Decompositions and reductions of snarks
- 1‐Factor and Cycle Covers of Cubic Graphs
- Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
