6-decomposition of snarks
\textit{R. Nedela} and \textit{M. Škoviera} proved in [J. Graph Theory 22, No. 3, 253--279 (1996; Zbl 0856.05082)] that when \(G\) is a snark with a \(k\)-edge cut, \(k\geq 2\), whose removal leaves two \(3\)-colorable components, then they can be both completed into snarks of order at most \(|G|\) by adding at most \(\kappa(k)\) vertices. The values of \(\kappa(k)\) are known for \(k=2,3,4,5\). The authors find a set of 14 complements that suffice to perform \(6\)-decompositions of snarks with at most 30 vertices. They also show that if this set is not complete to perform \(6\)-decompositions of all snarks, then \(\kappa(k) \geq 20\) and there are strong restrictions on the structure of the missing complements, if there are any.
- Classification and characterizations of snarks
- Construction of class two graphs with maximum vertex degree three
- Decomposition of snarks
- Decompositions and reductions of snarks
- Factorisation of snarks
- scientific article; zbMATH DE number 1737273 (Why is no real title available?)
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Non-bicritical critical snarks
- Snarks and reducibility
- Morphology of small snarks
- Some results on the structure of multipoles in the study of snarks
- Decomposition of snarks
- Decompositions and reductions of snarks
- Cubic graphs with colouring defect 3
- Measures of edge-uncolorability of cubic graphs
- Kempe equivalence classes of cubic graphs embedded on the projective plane
This page was built for publication: 6-decomposition of snarks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761505)
