Snarks with large oddness and small number of vertices

DOI10.1007/978-88-7642-475-5_10zbMath1293.05166OpenAlexW91226276MaRDI QIDQ5419943

Ján Mazák, Martin Škoviera, Edita Máčajová, Robert Lukot'ka

Publication date: 11 June 2014

Published in: The Seventh European Conference on Combinatorics, Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-88-7642-475-5_10

zbMATH Keywords

Petersen graph2-connected cubic graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Snarks with large oddness and small number of vertices ⋮ Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 ⋮ Avoiding 5-Circuits in 2-Factors of Cubic Graphs

Cites Work

• Generation and properties of snarks
• Superposition and constructions of graphs without nowhere-zero \(k\)-flows
• Double covers of cubic graphs with oddness 4
• Measurements of edge-uncolorability
• Five cycle double covers of some cubic graphs
• Snarks with large oddness and small number of vertices

This page was built for publication: Snarks with large oddness and small number of vertices