A cyclically 6-edge-connected snark of order 118

DOI10.1016/0012-365X(95)00237-QzbMath0870.05025MaRDI QIDQ1356433

Martin Kochol

Publication date: 9 June 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

snark

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Superposition and constructions of graphs without nowhere-zero \(k\)-flows ⋮ 5-Cycle Double Covers, 4-Flows, and Catlin Reduction ⋮ Approximation of 3-Edge-Coloring of Cubic Graphs ⋮ Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks. ⋮ Measures of edge-uncolorability of cubic graphs ⋮ On cyclic edge-connectivity of fullerenes ⋮ Smallest counterexample to the 5-flow conjecture has girth at least eleven ⋮ Complexity of approximation of 3-edge-coloring of graphs ⋮ Irreducible snarks of given order and cyclic connectivity ⋮ Some Topics in Graph Theory ⋮ Berge-Fulkerson coloring for some families of superposition snarks ⋮ Morphology of small snarks

Cites Work

• Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks.
• Snarks without small cycles
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Unnamed Item
• Unnamed Item

This page was built for publication: A cyclically 6-edge-connected snark of order 118