6-decomposition of snarks
From MaRDI portal
Publication:1761505
DOI10.1016/j.ejc.2012.07.019zbMath1256.05192OpenAlexW2008317264MaRDI QIDQ1761505
Edita Máčajová, Ján Karabáš, Roman Nedela
Publication date: 15 November 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2012.07.019
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (4)
Cubic graphs with colouring defect 3 ⋮ Measures of edge-uncolorability of cubic graphs ⋮ Some results on the structure of multipoles in the study of snarks ⋮ Morphology of small snarks
Cites Work
- Construction of class two graphs with maximum vertex degree three
- Classification and characterizations of snarks
- Non-bicritical critical snarks
- Factorisation of snarks
- Decomposition of snarks
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Decompositions and reductions of snarks
- Unnamed Item
- Unnamed Item
This page was built for publication: 6-decomposition of snarks