Factorisation of snarks
From MaRDI portal
Publication:2380465
zbMath1215.05057MaRDI QIDQ2380465
Miroslav Chladný, Martin Škoviera
Publication date: 26 March 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/228345
Related Items
Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs ⋮ Cubic graphs with colouring defect 3 ⋮ Rotationally symmetric snarks from voltage graphs ⋮ Critical and flow-critical snarks coincide ⋮ Measures of edge-uncolorability of cubic graphs ⋮ 6-decomposition of snarks ⋮ Cubic graphs that cannot be covered with four perfect matchings ⋮ Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 ⋮ From edge-coloring to strong edge-coloring ⋮ Morphology of small snarks