Superposition and constructions of graphs without nowhere-zero k-flows

European Journal of Combinatorics

Volumn 23, Issue 3, 2002, Pages 281-306

  Kochol, Martin ^a  

^a INSTITUTE OF CHEMISTRY   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036086951     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.2001.0563     Document Type: Article

References (44)

1. G. M. Adelson-Velskij and A. Titov, On 4-chromatic cubic graphs, Vopr. Kibernet. (Moscow), 1 (1974), 5-14, in Russian.
2. V. A. Aksionov, The extension of a 3-coloring on planar graphs, Diskret. Analiz, 16 (1974), 3-19, in Russian.
3. G. D. Birkhoff, The reducibility of maps, Am. J. Math., 35 (1913), 115-128.
4. D. Blanuša, Le problème des quatre couleurs, Hrvatsko Prirodoslovno Društvo. Glas. Mat.-Fiz. Astr. Ser. II., 1 (1946), 31-42, in Croatian.
5. O. V. Borodin, A new proof of Grünbaum's 3 color theorem, Discrete Math., 169 (1997), 177-183.
6. A. U. Celmins, On cubic graphs that do not have an edge-3-colouring, Ph. D. Thesis, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada, 1984.
7. U. A. Celmins and E. R. Swart, The constructions of snarks Research Report CORR 79-18, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada, (1979).
8. A. G. Chetwynd and R. J. Wilson, Snarks and supersnarks, in: The Theory and Applications of Graphs, Y. Alavi, G. Chartrand, D. L. Goldsmith, L. Lesniak-Foster and D. R. Lick (eds), Wiley, New York, 1981, pp. 215-241.
9. M. R. Garey, D. S. Johnson and L. Stockmeyer, Some simplified NP-complete graph problems, Theor. Comput. Sci., 1 (1976), 237-267.
10. M. K. Goldberg, Construction of class 2 graphs with maximum vertex degree 3, J. Comb. Theory Ser. B, 31 (1981), 282-291.
11. H. Grötzsch, Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel, Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg. Math.-Nat. Reihe, 8 (1959), 109-120.
12. B. Grünbaum, Grötzsch's theorem on 3-colorings, Michigan Math. J., 10 (1963), 303-310.
13. J. Holyer, The NP-completeness of edge-coloring, SIAM J. Comput., 10 (1981), 718-720.
14. A. Huck and M. Kochol, Five cycle double covers of some cubic graphs, J. Comb. Theory Ser. B, 64 (1995), 119-125.
15. R. Isaacs, Infinite families of nontrivial trivalent graphs which are not Tait colorable, Am. Math. Monthly, 82 (1975), 221-239.
16. F. Jaeger, Flows and generalized coloring theorems in graphs, J. Comb. Theory Ser. B, 26 (1979), 205-216.
17. F. Jaeger, Nowhere-zero flow problems, in: Selected Topics in Graph Theory 3, L. W. Beineke and R. J. Wilson (eds), Academic Press, New York, 1988, pp. 71-95.
18. F. Jaeger and T. Swart, Conjecture 1, in: Combinatorics 79, M. Deza and I. G. Rosenberg (eds), Annals of Discrete Mathematics, Amsterdam, North-Holland, 1980, 9, p. 305.
19. A. B. Kempe, A memoir of the theory of mathematical form, Phil. Trans. R. Soc. London, 177 (1886), 1-70.
20. P. A. Kilpatrick, Tutte's first colour-cycle conjecture, Ph. D. Thesis, Cape Town, South Africa, 1975.
21. M. Kochol, Constructions of cyclically 6-edge-connected snarks, in: Technical Report TR-II-SAS-07/93-05, Institute for Informatics, Slovak Academy of Sciences, Bratislava, Slovakia, 1993.
22. M. Kochol, Cycle double covering of graphs, in: Technical Report TR-II-SAS-08/93-7, Institute for Informatics, Slovak Academy of Sciences, Bratislava, Slovakia, 1993.
23. M. Kochol, Snarks without small cycles, J. Comb. Theory Ser. B, 67 (1996), 34-47.
24. M. Kochol, A cyclically 6-edge-connected snark of order 118, Discrete Math., 161 (1996), 297-300.
25. M. Kochol, Hypothetical complexity of the nowhere-zero 5-flow problem, J. Graph Theory, 28 (1998), 1-11.
26. M. Kochol, Cubic graphs without a Petersen minor have nowhere-zero 5-flows, Acta Math. Univ. Comenian. (N.S), 68 (1999), 249-252.
27. M. Kochol, Sublinear defect principle in graph theory, in: Tech. Rep. 20/2000, Mathematical Institute, Slovak Academy of Sciences, Bratislava, Slovakia, [http://www.mat.savba.sk/preprints].
28. M. Kochol, Stable dominating circuits in snarks, Discrete Math., 233 (2001), 247-256.
29. M. Kochol, An equivalent version of the 3-flow conjecture, J. Comb. Theory Ser. B, 83 (2001), 258-261.
30. W. F. McGee, A minimal cubic graph of girth seven, Can. Math. Bull., 3 (1960), 149-152.
31. J. Petersen, Sur le théorème de Tait, Interméd. Math., 15 (1898), 225-227.
32. R. Rizzi, Indecomposable r-graphs and some other counterexamples, J. Graph Theory, 32 (1999), 1-15.
33. R. Rizzi, On 4-connected graphs without even cycle decompositions, Disctrete Math., to appear.
34. R. W. Robinson and N. C. Wormald, Almost all cubic graphs are hamiltonian, Random Struct. Algorithms, 3 (1982), 117-125.
35. P. D. Seymour, Nowhere-zero 6-flows, J. Comb. Theory Ser. B, 30 (1981), 130-135.
36. P. G. Tait, Remarks on the colouring of maps, Proc. Roy. Soc. Edinburgh, 10 (1880), 729.
37. C. Thomassen, Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane, J. Comb. Theory Ser. B, 62 (1994), 268-279.
38. W. T. Tutte, A contribution to the theory of chromatic polynomials, Can. J. Math., 6 (1954), 80-91.
39. W. T. Tutte, A class of abelian groups, Can. J. Math., 8 (1956), 13-28.
40. W. T. Tutte, On the algebraic theory of graph colorings, J. Comb. Theory, 1 (1966), 15-50.
41. J. J. Watkins, Snarks, Ann. New York Acad. Sci., 576 (1989), 606-622.
42. 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), Wiley, New York, 1991, pp. 1129-1144.
43. D. H. Younger, Integer flows, J. Graph Theory, 1 (1983), 349-357.
44. C-Q. Zhang, Integral Flows and Cycle Covers of Graphs, Dekker, New York, 1997.