On the number of hamiltonian cycles in bipartite graphs

Combinatorics Probability and Computing

Volumn 5, Issue 4, 1996, Pages 437-442

  Thomassen, Garsten ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17644426043     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0963548300002182     Document Type: Article

References (6)

1. Entringer, R. C. and Swart, H. (1980) Spanning cycles of nearly cubic graphs. J. Combinatorial Theory B 29 303-309.
2. Jackson, B. (1993) A zero-free interval for chromatic polynomials of graphs. Combinatorics, Probability and Computing 2 325-336.
3. Thomason, A. G. (1978). Hamiltonian cycles and uniquely edge colourable graphs. Ann. Discrete Math. 3 259-268.
4. Thomassen, C. (1983) Girth in graphs. J. Combinatorial Theory B 35 129-141.
5. Thomassen, C. (1984) Plane representations of graphs. In: J. A. Bondy and U. S. R. Murty (eds), Academic Press, Toronto, 43-69.
6. Tutte, W. T. (1946) On Hamiltonian circuits. J. London Math. Soc. 21 98-101.