Blanusa, D. "Problem cetiriju boja." Glasnik Mat. Fiz. Astr. Ser. II.1, 31-42, 1946.Brinkmann, G. and Steffen, F. "Snarks and Reducibility." Ars Combin.50, 292-296, 1998.Brinkmann, G.; Goedgebeur, J.; Hägglund, J.; and Markström, K. "Generation and Properties of Snarks." J. Comb. Th.103, 468-488, 2013.Cameron, P. J.; Chetwynd, A. G.; and Watkins, J. J. "Decomposition of Snarks." J. Graph Th.11, 13-19, 1987.Chetwynd, A. G. and Wilson, R. J. "Snarks and Supersnarks." In The Theory and Applications of Graphs (Ed. Y. Alavi et al. ). New York: Wiley, pp. 215-241, 1981.Descartes, B. "Network-Colourings." Math. Gaz.32, 67-69, 1948.Fiorini, S. "Hypohamiltonian Snarks." In Graphs and Other Combinatorial Topics (Ed. M. Fiedler). Leipzig, Germany: Teubner, 1983.Gardner, M. "Mathematical Games: Snarks, Boojums, and Other Conjectures Related to the Four-Color-Map Theorem." Sci. Amer.234, No. 4, 126-130, 1976.Goldberg, M. K. "Construction of Class 2 Graphs with Maximum Vertex Degree 3." J. Combin. Th. Ser. B31, 282-291, 1981.Hägglund, J. and Markström, K. "On Stable Cycles and Cycle Double Covers of Graphs with Large Circumference." Disc. Math.312, 2540-2544, 2012.Holton, D. A. and Sheehan, J. "Snarks." Ch. 3 in The Petersen Graph. Cambridge, England: Cambridge University Press, pp. 79-111, 1993.House of Graphs. "Snarks." https://hog.grinvin.org/Snarks#snarks.Isaacs, R. "Infinite Families of Nontrivial Trivalent Graphs Which Are Not Tait Colorable." Amer. Math. Monthly82, 221-239, 1975.Nedela, R. and Skoviera, M. "Decompositions and Reductions of Snarks." J. Graph Th.22, 253-279, 1983.Read, R. C. and Wilson, R. J. An Atlas of Graphs. Oxford, England: Oxford University Press, pp. 263 and 276-281, 1998.Royle, G. "Snarks." http://people.csse.uwa.edu.au/gordon/remote/cubics/#snarks.Sloane, N. J. A. Sequence A130315 in "The On-Line Encyclopedia of Integer Sequences."Steffen, E. "Classification and Characterisations of Snarks." SFB-Preprint 94-056. Bielefeld, Germany: Universität Bielefeld, 1994.Szekeres, G. "Polyhedral Decompositions of Cubic Graphs." Bull. Austral. Math. Soc.8, 367-387, 1973.Watkins, J. J. "Snarks." Ann. New York Acad. Sci.576, 606-622, 1989.West, D. B. Introduction to Graph Theory, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, pp. 304-306, 2000.
），以及 20 个具有 22 个顶点的。
、12、14、... 个节点的 snarks 数量为 1、0、0、0、2、6、20、38、280、2900、28399、293059、3833587、60167732、... (OEIS A130315; Brinkmann 和 Steffen 1998)。
、
、
和 
的图示不正确。
