Stable dominating circuits in snarks

Discrete Mathematics

Volumn 233, Issue 1-3, 2001, Pages 247-256

  Kochol, Martin ^a  

^a INSTITUTE OF CHEMISTRY   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035962198     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00244-2     Document Type: Article

References (26)

1. A. Cavicchioli, M. Meschiari, B. Ruini, F. Spaggiari, A survey on snarks and new results: products, reducibility and computer search, J. Graph Theory 28 (1998) 57-86.
2. A.G. Chetwynd, R.J. Wilson, Snarks and supersnarks, in: Y. Alavi, G. Chartrand, D.L. Goldsmith, L. Lesniak-Foster, D.R. Lick (Eds.), The Theory and Applications of Graphs, Wiley, New York, 1981, pp. 215-241.
3. H. Fleischner, Cycle decompositions, 2-coverings, removable cycles and the four-color-disease, in: J.A. Bondy, U.S.R. Murty (Eds.), Progress in Graph Theory, Academic Press, Toronto, 1984, pp. 233-245.
4. H. Fleischner, Proof of the strong 2-cover conjecture for planar graphs, J. Combin. Theory Ser. B 40 (1986) 229-230.
5. H. Fleischner, Some blood, sweat, but no tears in eulerian graph theory, Congr. Numer. 63 (1988) 8-48.
6. H. Fleischner, Eulerian Graphs and Related Topics, Part 1, Vol. 2, Annals of Discrete Mathematics, Vol. 50, North-Holland, Amsterdam, 1991.
7. H. Fleischner, Uniqueness of maximal dominating cycles in 3-regular graphs and of Hamiltonian cycles in 4-regular graphs, J. Graph Theory 18 (1994) 449-459.
8. L. Goddyn, Cycle covers of graphs, Ph. D. Thesis, University of Waterloo, Waterloo, Ontario, Canada, 1988.
9. A. Huck, Personal communication.
10. A. Huck, M. Kochol, Five cycle double covers of some cubic graphs, J. Combin. Theory Ser. B 64 (1995) 119-125.
11. R. Isaacs, Infinite families of non-trivial trivalent graphs which are not Tait colorable, Amer. Math. Monthly 82 (1975) 221-239.
12. F. Jaeger, A survey of the cycle double cover conjecture, in: B.R. Alspach, C.D. Godsil (Eds.), Cycles in Graphs, Annals of Discrete Mathematics, Vol. 27, North-Holland, Amsterdam, 1985, pp. 1-12.
13. F. Jaeger, Nowhere-zero flow problems, in: L. W. Beineke, R.J. Wilson (Eds.), Selected Topics in Graph Theory, Vol. 3, Academic Press, New York, 1988, pp. 71-95.
14. M. Kochol, Constructions of cyclically 6-edge-connected snarks, Technical Report TR-II-SAS-07/ 93-05, Institute for Informatics, Slovak Academy of Sciences, Bratislava, Slovakia, 1993.
15. M. Kochol, Cycle double covering of graphs, Technical Report TR-II-SAS-08/93-7, Institute for Informatics, Slovak Academy of Sciences, Bratislava, Slovakia, 1993.
16. M. Kochol, Snarks without small cycles, J. Combin. Theory Ser. B 67 (1996) 34-47.
17. M. Kochol, A cyclically 6-edge-connected snark of order 118, Discrete Math. 161 (1996) 297-300.
18. M. Kochol, Hypothetical complexity of the nowhere-zero 5-flow problem, J. Graph Theory 28 (1998) 1-11.
19. M. Kochol, Superposition and constructions of graphs without nowhere-zero k-flows, manuscript.
20. M. Kochol, Equivalence of Fleischner's and Thomassen's conjectures, J. Combin. Theory Ser. B 78 (2000) 277-279.
21. A. Raspaud, Cycle covers and nowhere zero flows, manuscript.
22. G. Sabidussi, Conjecture 2.4, in: B.R. Alspach, C.D. Godsil (Eds.), Cycles in Graphs, Annals of Discrete Mathematics, Vol. 27, North-Holland, Amsterdam, 1985, p. 462.
23. P.D. Seymour, Sums of circuits, in: J.A. Bondy, U.S.R. Murty (Eds.), Graph Theory and Related Topics, Academic Press, New York, 1979, pp. 341-355.
24. J.J. Watkins, R.J. Wilson, A survey of snarks, in: Y. Alavi, G. Chartrand, O.R. Oellermann, A.J. Schwenk (Eds.), Graph Theory, Combinatorics and Applications, Wiley, New York, 1991, pp. 1129-1144.
25. C.-Q. Zhang, Cycle cover theorems and their applications, in: N. Robertson, P. Seymour (Eds.), Graph Structure Theory, Contemporary Mathematics, Vol. 147, American Mathematical Society, Providence, 1993, pp. 405-418.
26. C.-Q. Zhang, Integer Flows and Cycle Covers of Graphs, Marcel Dekker, New York, 1997.