Snarks
From Gdesigns
Relevant articles: _{[1]}, _{[2]}, _{[3]}.
Snarks
Results have been obtained for a number snarks. The spectrum problem is
completely solved for the Petersen graph, the Tietze graph, the two vertex Blanusa snarks, the six snarks on vertices, the twenty snarks on vertices, and Goldberg's snark 3. Partial results have also been obtained on the two Celmin'sSwart snarks, the two vertex Blanusa snarks, the flower snark , the double star snark, the two vertex Blanusa snarks, Zamfirescu's graph, Goldberg's snark 5, the Szekeres snark, and the Watkins snark.
Spectrum Results
Table 1 summarises the known results on the spectrum problem for various snarks. The reference for each of these results is _{[2]}, except that the spectrum problem for the Petersen graph was solved in _{[1]}.
Designs covered by Wilson’s Theorem _{[3]} are ignored in the listed possible exceptions in Table 1.
Graph  Spectrum  Possible exceptions 
 
 

References
 ↑ ^{1.0} ^{1.1} Adams, P. and Bryant, D. E. The spectrum problem for the Petersen graph, J. Graph Theory, 22, 175–180 (1996).
 ↑ ^{2.0} ^{2.1} Forbes, A. D. Snark Designs, Preprint,
 ↑ ^{3.0} ^{3.1} Wilson, R. M. Decompositions of complete graphs into subgraphs isomorphic to a given graph, Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen, 1975), Congressus Numerantium, No. XV, Utilitas Math., Winnipeg, Man. 647–659 (1976).