Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
From MaRDI portal
Publication:5225040
DOI10.26493/1855-3974.1601.e75zbMath1416.05104arXiv1712.07867OpenAlexW3105907074MaRDI QIDQ5225040
Edita Máčajová, Martin Škoviera, Jan Goedgebeur
Publication date: 25 July 2019
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.07867
Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Flows in graphs (05C21)
Related Items (4)
Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs ⋮ Decomposition of cubic graphs with cyclic connectivity 5 ⋮ The smallest nontrivial snarks of oddness 4 ⋮ Morphology of small snarks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On snarks that are far from being 3-edge colorable
- Sparsely intersecting perfect matchings in cubic graphs
- Generation and properties of snarks
- Measures of edge-uncolorability of cubic graphs
- Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
- Removable edges in cyclically 4-edge-connected cubic graphs
- Classification and characterizations of snarks
- Superposition and constructions of graphs without nowhere-zero \(k\)-flows
- 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
- Special classes of snarks
- Measurements of edge-uncolorability
- A note about the dominating circuit conjecture
- Five cycle double covers of some cubic graphs
- The smallest nontrivial snarks of oddness 4
- Factorisation of snarks
- Practical graph isomorphism. II.
- The hunting of a snark with total chromatic number 5
- Irreducible snarks of given order and cyclic connectivity
- On the total coloring of certain graphs
- Hamiltonian results inK1,3-free graphs
- Minimal Cyclic-4-Connected Graphs
- Decomposition of snarks
- Graphes Cubiques D'Indice Chromatique Quatre
- The NP-Completeness of Edge-Coloring
- Almost all cubic graphs are Hamiltonian
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Decompositions and reductions of snarks
- A Proof of 4-Coloring the Edges of a Cubic Graph
- The Generation of Fullerenes
- Snarks with large oddness and small number of vertices
- The Colour Numbers of Complete Graphs
- Network-Colourings
- A Theorem on Coloring the Lines of a Network
This page was built for publication: Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
