Irreducible snarks of given order and cyclic connectivity

DOI10.1016/j.disc.2006.02.003zbMath1092.05026OpenAlexW2064033752MaRDI QIDQ2495514

Edita Máčajová, Martin Škoviera

Publication date: 30 June 2006

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

Full work available at URL: https://doi.org/10.1016/j.disc.2006.02.003

zbMATH Keywords

edge-colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Rotationally symmetric snarks from voltage graphs ⋮ Coverings of cubic graphs and 3-edge colorability ⋮ Superposition of snarks revisited ⋮ Measures of edge-uncolorability of cubic graphs ⋮ Some Topics in Graph Theory ⋮ Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 ⋮ Morphology of small snarks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Construction of class two graphs with maximum vertex degree three
• Note sur la non existence d'un snark d'ordre 16
• A cyclically 6-edge-connected snark of order 118
• Classification and characterizations of snarks
• Snarks without small cycles
• Decomposition of snarks
• The NP-Completeness of Edge-Coloring
• Almost all cubic graphs are Hamiltonian
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Decompositions and reductions of snarks
• Network-Colourings
• Problem Session

This page was built for publication: Irreducible snarks of given order and cyclic connectivity