On the smallest snarks with oddness 4 and connectivity 2

zbMath1390.05102arXiv1710.00757MaRDI QIDQ1753089

Jan Goedgebeur

Publication date: 25 May 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.00757

zbMATH Keywords

cubic graphoddnesssnarkchromatic indexcomputationexhaustive search

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Small snarks with large oddness ⋮ The smallest nontrivial snarks of oddness 4 ⋮ Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44

Uses Software

• House of Graphs
• snarkhunter

Cites Work

• Unnamed Item
• Generation and properties of snarks
• House of Graphs: a database of interesting graphs
• Small snarks with large oddness
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• The Generation of Fullerenes
• Polyhedral decompositions of cubic graphs
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: On the smallest snarks with oddness 4 and connectivity 2