Answers are grounded in this paper and cite their sources.
According to M. Gardner [“Mathematical Games: Snarks, Boojums, and Other Conjectures Related to the Four-Color-Map Theorem,” Scientific American, vol. 234 (1976), pp. 126–130], a snark is a nontrivial cubic graph whose edges cannot be properly colored by three colors. The problem of what “nontrivial” means is implicitly or explicitly present in most papers on snarks, and is the main motivation of the present paper. Our approach to the discussion is based on the following observation. If G is a snark with a k-edge-cut producing components G1 and G2, then either one of G1 and G2 is not 3-edge-colorable, or by adding a “small” number of vertices to either component one can obtain snarks G1 and G2 whose order does not exceed that of G. The two situations lead to a definition of a k-reduction and k-decomposition of G. Snarks that for m < k do not admit m-reductions, m-decompositions, or both are k-irreducible, k-indecomposable, and k-simple, respectively. The irreducibility, indecomposability, and simplicity provide natural measures of nontriviality of snarks closely related to cyclic connectivity. The present paper is devoted to a detailed investigation of these invariants. The results give a complete characterization of irreducible snarks and characterizations of k-simple snarks for k ≤ 6. A number of problems that have arisen in this research conclude the paper.
No takes yet. Share an insight, caveat, or question.
Nedela et al. (1996) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: