Snarks and flow-snarks constructed from coloring-snarks.

DOI10.1016/S0012-365X(03)00250-4zbMath1033.05043OpenAlexW2066855099MaRDI QIDQ1427477

Martin Kochol

Publication date: 14 March 2004

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00250-4

zbMATH Keywords

SnarkEdge-coloring\(k\)-coloring-snark\(k\)-flow-snarkNowhere-zero \(k\)-flow

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Superposition of snarks revisited ⋮ Measures of edge-uncolorability of cubic graphs ⋮ Morphology of small snarks

Cites Work

• Construction of class two graphs with maximum vertex degree three
• Superposition and constructions of graphs without nowhere-zero \(k\)-flows
• An equivalent version of the 3-flow conjecture
• Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
• A Class Of Abelian Groups
• From the theory of regular graphs of third and fourth degree
• A survey on snarks and new results: Products, reducibility and a computer search
• A Contribution to the Theory of Chromatic Polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Snarks and flow-snarks constructed from coloring-snarks.