Snarks without small cycles

Journal of Combinatorial Theory. Series B

Volumn 67, Issue 1, 1996, Pages 34-47

  Kochol, Martin ^a  

^a INSTITUTE OF CHEMISTRY   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030141041     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1996.0032     Document Type: Article

References (34)

1. 1. N. L. BIGGS, "Algebraic Graph Theory," Cambridge Univ. Press, London, 1974.
2. 2. N. L. BIGGS AND M. J. HOARE, The sextet construction for cubic graphs, Combinatorica 3 (1983), 153-165.
3. 3. D. BLANUŠA, Problem ceteriju boja (The problem of four colors), Hrvat. Prirodosl. Druž. Glas. Mat.-Fiz. Astr. Ser II 1 (1946), 31-42.
4. 4. J. A. BONDY AND U. S. R. MURTY, "Graph Theory with Applications," Macmillan & Co., London, 1976.
5. 5. U. A. CELMINS, On cubic graphs that do not have an edge-3-colouring, Ph.D. thesis, Dept. of Combinatorics and Optimization, University of Waterloo, Canada, 1984.
6. 6. U. A. CELMINS AND E. R. SWART, "The Construction of Snarks," Research Report CORR 79-18, Dept. of Combinatorics and Optimization, University of Waterloo, Canada, 1979.
7. 7. A. G. CHETWYND AND R. J. WILSON, Snarks and supersnarks, in "The Theory and Applications of Graphs" (G. Chartrand. Y. Alavi, D. L. Goldsmith, L. Lesniak-Foster, D. R. Lick, Eds.), pp. 215-241, Wiley, New York, 1981.
8. 8. B. DESCARTES, Network coloring, Math. Gazette 32 (1948), 67-69.
9. 9. P. ERDOS AND H. SACHS, Reguläre Graphen gegebener Taillenweite mit minimaler Knotenzahl, Wis. Z. Univ. Halle-Wittenberg, Math.-Nat. R. 12 (1963), 251-258.
10. 10. M. A. FIOL, A Boolean algebra approach to the construction of sparks, in "Graph Theory, Combinatorics, and Applications" (Y. Alavi, G. Chartrand, O. R. Oellermann, A. J. Shwenk, Eds.), pp. 493-524, Wiley, New York, 1991.
11. 11. M. GARDNER, Mathematical games: Snarks, boojums, and other conjectures related to the four-color-map theorem, Sci. Am. 234, April (1976), 126-130.
12. 12. L. GODDYN, A girth requirement for the double cycle cover conjecture, in "Cycles in Graphs" (B. R. Alspach and C. D. Godsil, Eds.), Ann. Discrete Math., Vol. 27, pp. 13-26, North-Holland, Amsterdam, 1985.
13. 13. W. IMRICH, Explicit construction of regular graphs without small cycles, Combinatorica 4 (1984), 53-59.
14. 14. R. ISAACS, Infinite families of non-trivial trivalent graphs which are not Tait colorable, Amer. Math. Monthly 82 (1975), 221-239.
15. 15. F. JAEGER, A survey of the cycle double cover conjecture, in "Cycles in Graphs" (B. R. Alspach and C. D. Godsil, Eds.), Ann. Discrete Math., Vol. 27, pp. 1-12, North-Holland, Amsterdam, 1985.
16. 16. F. JAEGER, Nowhere-zero flow problems, in "Selected topics in Graph Theory 3" (L. Beineke and R. J. Wilson, Eds.), pp. 71-95, Academic Press, New York, 1988.
17. 17. F. JAEGER AND T. SWART, Conjecture 1, in "Combinatorics 79" (M. Deza and I. G. Rosenberg, Eds.), Ann. Discrete Math., Vol. 9, p. 305, Problem Session, North-Holland, Amsterdam, 1980.
18. 18. F. JAEGER AND T. SWART, Conjecture 2, in "Combinatorics 79" (M. Deza and I. G. Rosenberg, Eds.), Ann. Discrete Math., Vol. 9, p. 305, Problem Session, North-Holland, Amsterdam, 1980.
19. 19. S. JENDROL', R. NEDELA, AND M. Škoviera, Constructing regular maps and graphs from planar quotients, Math. Slovaca, submitted.
20. 20. M. KOCHOL, A cyclically 6-edge-connected snark of order 118, Discrete Math., to appear.
21. 21. M. KOCHOL, "Construction of Cyclically 6-Edge-Connected Snarks," Technical Report TR-II-SAS-07/93-5, Institute for Informatics, Slovak Academy of Sciences, Bratislava, Slovakia, 1993.
22. 22. M. KOCHOL, Superposition and constructions of graphs without nowhere-zero k-flows, manuscript.
23. 23. G. A. MARGULIS, Javnyje teoretiko-grupovyje konstrukcii kombinatornych schem i ich primenenija v postroenii rasširitelej i koncentratorov, Problemy Peredači Informacii 24 (1988), 51-60.
24. 24. W. F. MCGEE, A minimal cubic graph of girth seven, Canad. Math. Bull. 3 (1960), 149-152.
25. 25. R. NEDELA AND M. ŠKOVIERA, Atoms of cyclic connectivity in transitive cubic graphs, in "Contemporary Methods in Graph Theory" (R. Bodendiek, Ed.), pp. 470-488, BI-Wissenschaftsverlag, Mannheim, 1990.
26. 26. H. SACHS, "Einfuhrung in die Theorie der Endlichen Graphen," Teil I, Teubner, Leipzig, 1970.
27. 27. P. G. TAIT, Remarks on the colouring of maps, Proc. R. Soc. Edinburgh 10 (1880), 501-503, 729.
28. 28. W. T. TUTTE, A contribution to the theory of chromatic polynomials, Canad. J. Math. 6 (1954), 80-91.
29. 29. W. T. TUTTE, On the algebraic theory of graph colorings, J. Combin. Theory 1 (1966), 15-50.
30. 30. V. G. VIZING, On an estimate of the chromatic class of a p-graph, Diskret. Analiz 3 (1964), 25-30.
31. 31. H. WALTHER, Über reguläre Graphen gegebener Taillenweite mit minimaler Knotenzahl, Wiss. Z. HfE Ilmenau 11 (1965), 93-96.
32. 32. H. WALTHER, Eigenschaften van regulären Graphen gegebener Taillenweite mit minimaler Knotenzahl, Wiss. Z. HfE Ilmenau 11 (1965), 167-168.
33. 33. J. J. WATKINS AND R. J. WILSON, A survey of snarks, in "Graph Theory, Combinatorics, and Applications" (Y. Alavi, G. Chartrand, O. R. Oellermann, and A. J. Schwenk, Eds.), pp. 1129-1144, Wiley, New York, 1991.
34. 34. A. WEISS, Girths of bipartite sextet graphs, Combinatorica 4 (1984), 241-245.