Constructions of graphs without nowhere-zero flows from boolean formulas

Ars Combinatoria

Volumn 70, Issue , 2004, Pages 257-264

  Kochol, Martin ^a  

^a INSTITUTE OF CHEMISTRY   (Slovakia)

Author keywords

Boolean formula; k snark; Nowhere zero k flow

Indexed keywords

EID: 20744442061     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (7)

1. [H] J. Holyer, The NP-completeness of edge-coloring, SIAM J. Comput. 10 (1981), 718-720.
2. [J] F. Jaeger, Nowhere-zero flow problems, Selected Topics in Graph Theory 3 (L. W. Beineke, R. J. Wilson, eds.), Academic Press, New York, 1988, pp. 71-95.
3. [K1] M. Kochol, Hypothetical complexity of the nowhere-zero 5-flow problem, J. Graph Theory 28 (1998), 1-11.
4. [K2] M. Kochol, Superposition and constructions of graphs without nowhere-zero k-flows, European J. Combin. (to appear).
5. [T1] W. T. Tutte, A contribution to the theory of chromatic polynomials, Canad. J Math. 6 (1954), 80-91.
6. [T2] W. T. Tutte, A class of Abelian groups, Canad. J. Math. 8 (1956), 13-28.
7. [Z] C.-Q. Zhang, Integral Flows and Cycle Covers of Graphs, Dekker, New York, 1997.