A Survey on Snarks and New Results: Products, Reducibility and a Computer Search

Journal of Graph Theory

Volumn 28, Issue 2, 1998, Pages 57-86

  Cavicchioli, A ^a   Meschiari, M ^a   Ruini, B ^a   Spaggiari, F ^a  

^a UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

Author keywords

Chromatic index; Classification problem; Computer algorithm; Cubic graphs; Cyclic edge connectivity; Girth; Indecomposable snarks; Irreducible snarks; Multipoles; Prime snarks; Snark moves; Snarks; Superposition

Indexed keywords

EID: 0032349387     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199806)28:2<57::AID-JGT1>3.0.CO;2-D     Document Type: Article

References (44)

1. D. Blanuša, The problem of four-colors, Glasnik Mat. 1 (1946), 31-42.
2. N. L. Biggs and M. J. Hoare, The sextet construction for cubic graphs. Combinatorica 3 (1983), 153-165.
3. G. Brinkmann, Fast generation of cubic graphs, J. Graph Theory 23 (1996), 139-149.
4. G. Brinkmann and E. Steffen, Snarks and reducibility, Ars Combinatorial, to appear.
5. P. J. Cameron, A. G. Chetwynd, and J. J. Watkins, Decomposition of snarks, J. Graph Theory 11 (1987), 13-19.
6. L. Cai, A snark of order 24, to appear.
7. U. A. Celmins and E. R. Swart, The construction of snarks, Department of Combinatorics and Optimization. Univ. of Waterloo, Research Report CORR 79-18.
8. A. G. Chetwynd and R. J. Wilson, Snarks and supersnarks, in The theory and applications of graphs, Wiley-Interscience, New York (1981), 215-241.
9. A. G. Chetwynd and A. J. W. Hilton, Snarks and k-snarks, Ars Combinatoria 25 (1988), 39-54.
10. B. Descartes, Network colourings, Math. Gazette 32 (1948), 67-69.
11. P. Erdös and R. J. Wilson, On the chromatic index of almost all graphs, J. Combin. Theory B 23 (1977), 255-257.
12. S. Fiorini and R. J. Wilson, Edge-colourings of graphs, Research Notes in Math. 16, Pitman, London (1977).
13. J. L. Fouquet, Graphes cubiques d'indice chromatique quatre, Ann. Discrete Math. 9 (1980), 23-28.
14. J. L. Fouquet, Note sur la non-existence d'un snark d'ordre 16, Discrete Math. 38 (1982), 163-171.
15. M. Gardner, Mathematical games: snarks, boojums, and other conjectures related to the four-color map theorem, Sci. Amer. 234 (1976), 126-130.
16. M. K. Goldberg, Construction of class 2 graphs with maximum vertex degree 3, J. Combin. Theory B 31 (1981), 282-291.
17. R. Isaacs, Infinite families of nontrivial trivalent graphs which are not Tait colorable, Amer. Math. Monthly 82 (1975), 221-239.
18. F. Jaeger and T. Swart, Conjecture 1, in Combinatorics 79, (M. Deza and I. G. Rosenberg Eds.), Ann. Discrete Math. 9 (1980), 305.
19. F. Jaeger and T. Swart, Conjecture 1, in Combinatorics 79, (M. Deza and I. G. Rosenberg Eds.), Ann. Discrete Math. 9 (1980), 305.
20. S. Jendrol', R. Nedela, and M. Škoviera, Constructing regular maps and graphs from planar quotients, Math. Slovaca, to appear.
21. T. R. Jensen and B. Toft, Graph coloring problems, Wiley Interscience, New York (1995).
22. D. A. Holton and J. Sheehan, The Petersen graph, Australian Math. Soc. Lect. Series 7, Cambridge Univ. Press, Cambridge (1993).
23. M. Kochol, Construction of cyclically 6-edge-connected snarks, Technical Report II-TR-SAS-07/93-5, Institute for Informatics, Slovak Academy of Sciences, Bratislava, Slovakia (1993).
24. M. Kochol, Snarks without small cycles, J. Combin. Theory (B) 67 (1996), 34-47.
25. M. Kochol, A cyclically 6-edge-connected snark of order 118, Discrete Math. 161 (1996), 297-300.
26. M. Kochol, Superposition and constructions of graphs without nowhere-zero k-flows, to appear.
27. W. F. Mc Gee, A minimal cubic graph of girth seven, Canad. Math. Bull. 3 (1960), 149-152.
28. R. Nedela and M. Škoviera, Atoms of cyclic connectivity in transitive cubic graphs, in Contemporary methods in graph theory, (R. Bodendiek. Ed.). BI-Wissenschfts Verlag, Mannheim (1990), 470-488.
29. R. Nedela and M. Škoviera, Decompositions and reductions of snarks, J. Graph Theory 22 (1996), 253-279.
30. R. Nedela and M. Škoviera, Constructions of irreducible snarks, to appear.
31. J. Petersen, Die theorie de regulären graphs, Acta Math. 15 (1891), 193-220.
32. J. Petersen, Sur le théorème de Tait, L'intermédiaire des Mathématiciens 5 (1898), 225-227.
33. M. Preissmann, Snarks of order 18, Discrete Math. 42 (1982), 125-126.
34. M. Škoviera, Dipoles and the existence of irreducible snarks, to appear.
35. E. Steffen, Classifications and characterizations of snarks, Preprint SFB-94-056, Universität Bielefeld (1994).
36. G. Szekeres, Polyhedral decompositions of cubic graphs, Bull. Austral. Math. Soc. 8 (1973), 367-387.
37. G. Szekeres, Non-colourable trivalent graphs, in Combinatorial math., (A. P. Street and W. D. Wallis, Eds.), Springer-Verlag Lect. Notes 452 (1975), 227-233.
38. V. G. Vizing, On an estimate of the chromatic class of a p-graph, Diskret. Analiz 3 (1964), 25-30.
39. V. G. Vizing, Critical graphs with a given chromatic class, Diskret. Analiz 5 (1965), 9-17.
40. J. J. Watkins, On the construction of snarks, Ars Combinatoria 16 B (1983), 111-123.
41. J. J. Watkins, Snarks, in Graph theory and its applications (1st China-USA International Conference Jinan, 1986), (M. F. Capobianco, M. G. Guan, D. F. Hsu, and F. Tian, Eds.), Ann. New York Acad. Sci. 576 (1989), 606-622.
42. J. J. Watkins, Snarks, in Graph theory and its applications (1st China-USA International Conference Jinan, 1986), (M. F. Capobianco, M. G. Guan, D. F. Hsu, and F. Tian, Eds.), Ann. New York Acad. Sci. 576 (1989), 606-622.
43. J. J. Watkins and R. J. Wilson, A survey of snarks, in Graph theory, combinatorics, and applications (Kalamazoo, MI, 1988), (Y. Alavi, G. Chartrand, O. R. Oellermann, and A. J. Schwenk, Eds.), Wiley Interscience, New York (1991), 1129-1144.
44. A. Weiss, Girths of bipartite sextet graphs, Combinatorica 4 (1984), 241-245.