Hypothetical Complexity of the Nowhere-Zero 5-Flow Problem

Journal of Graph Theory

Volumn 28, Issue 1, 1998, Pages 1-11

  Kochol, Martin ^a  

^a Suché Mýto 19   (Slovakia)

Author keywords

Nowhere zero 5 flow; NP completeness

Indexed keywords

EID: 0032367093     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199805)28:1<1::AID-JGT1>3.0.CO;2-Q     Document Type: Article

References (24)

1. K. Appel and W. Haken, Every planar map is four colorable, Contemporary Math. Series, Vol. 98, Amer. Math. Soc., Providence (1989).
2. U. A. Celmins, On cubic graphs that do not have an edge-3-colouring, Ph.D. Thesis, Dep. of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada (1984).
3. 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, D. R. Lick, Eds.), Wiley, New York (1981), pp. 215-241.
4. M. Gardner, Mathematical games: Snarks, boojoms, and other conjectures related to the four-color-map theorem, Sci. Am. 234 April (1976), 126-130.
5. M. R. Garey and D. S. Johnson, Computers and intractability, W. H. Freeman, San Francisco (1979).
6. M. R. Garey, D. S. Johnson, and L. Stockmeyer, Some simplified NP-complete graph problems, Theor. Comput. Sci. 1 (1976), 237-267.
7. I. Holyer, The NP-completeness of edge-coloring, SIAM J. Comput. 10 (1981), 718-720.
8. F. Jaeger, On nowhere-zero flows in multigraphs, Proc. Fifth British Combinatorial Conference (C. St. J. A. Nash-Williams and J. Sheehan, Eds.), Congressus Numerantium XV, Utilitas Math., Winnipeg (1976), pp. 373-378.
9. F. Jaeger, Flows and generalized coloring theorems in graphs, J. Combin. Theory Ser. B 26 (1979), 205-216.
10. 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.
11. F. Jaeger, N. Linial, C. Payan, and M. Tarsi, Group connectivity of graphs - a nonhomogeneous analogue of nowhere-zero flow properties, J. Combin. Theory Ser. B 56 (1992), 165-182.
12. P. A. Kilpatrick, Tune's first colour-cycle conjecture, Ph.D. Thesis, Cape Town (1975).
13. M. Kochol, Construction of cyclically 6-edge-connected snarks, Technical Report TR-II-SAS-07/93-05, Institute for Informatics, Slovak Academy of Sciences, Bratislava, Slovakia (1993).
14. M. Kochol, Superposition and constructions of graphs without nowhere-zero k-flows, manuscript.
15. M. Kochol, Polynomials and equivalence relations accompanied with nowhere-zero integral flows, manuscript.
16. N. Robertson, D. Sanders, P. Seymour, and R. Thomas, The four-color theorem, J. Combin. Theory Ser. B 70 (1997), 2-44.
17. P. D. Seymour, Nowhere-zero 6-flows, J. Combin. Theory Ser. B 30 (1981), 130-135.
18. E. Steffen, Tutte's 5-flow conjecture for graphs of nonorientable genus 5, J. Graph Theory 22 (1996), 309-319.
19. W. T. Tutte, A contribution to the theory of chromatic polynomials, Canad. J. Math. 6 (1954), 80-91.
20. W. T. Tutte, A class of Abelian groups, Canad. J. Math. 8 (1956), 13-28.
21. W. T. Tutte, On the algebraic theory of graph colorings, J. Combin. Theory 1 (1966), 15-50.
22. J. J. Watkins and R. J. Wilson, A survey of snarks, in Graph theory, combinatorics and applications (Y. Alavi, G. Chartrand, O. R. Oellermann, A. J. Schwenk, Eds.), Wiley, New York (1991), pp. 1129-1144.
23. D. H. Younger, Integer flows, J. Graph Theory 7 (1983), 349-357.
24. C.-Q. Zhang, Integer flows and cycle covers of graphs, Marcel Dekker, New York (1997).