A cyclically 6-edge-connected snark of order 118

DOI10.1016/0012-365X(95)00237-QMaRDI QIDQ1356433zbMATH OpenFDO

Authors Martin Kochol

Publication date 9 June 1997

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(95)00237-Q

zbMATH Keywords

snark

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites work

• scientific article; zbMATH DE number 867669 (Why is no real title available?)
• scientific article; zbMATH DE number 867711 (Why is no real title available?)
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks.
• Snarks without small cycles

Cited in

(13)

• Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks.
• Superposition and constructions of graphs without nowhere-zero k-flows
• Berge-Fulkerson coloring for some families of superposition snarks
• Morphology of small snarks
• Irreducible snarks of given order and cyclic connectivity
• Approximation of 3-Edge-Coloring of Cubic Graphs
• Some Topics in Graph Theory
• 5-Cycle Double Covers, 4-Flows, and Catlin Reduction
• Normal 5-edge-coloring of some snarks superpositioned by flower 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356433)