Chords of longest cycles in cubic graphs

Journal of Combinatorial Theory. Series B

Volumn 71, Issue 2, 1997, Pages 211-214

  Thomassen, Carsten ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031280722     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1997.1776     Document Type: Article

References (11)

1. Alon N., Tarsi M. Colourings and orientations of graphs. Combinatorica. 12:1992;125-134.
2. Alspach B., Godsil C. D. Cycles in Graphs. Ann. Discrete Math. 27:1985.
3. Bondy J. A. Basic graph theory. Handbook of Combinatorics. 1995;North-Holland, Amsterdam. p. 3-110.
4. Fleischner H. Uniqueness of maximal dominating cycles in 3-regular graphs and of Hamiltonian cycles in 4-regular graphs. J. Graph Theory. 18:1994;449-459.
5. Fleischner H., Stiebitz M. A solution to a colouring problem. Discrete Math. 101:1992;39-48.
6. Sheehan J. The multiplicity of Hamiltonian circuits in a graph. Fiedler M. Recent Advances in Graph Theory. 1975;447-480 Academia, Prague.
7. A. G. Thomason, Hamiltonian cycles and uniquely edge-colorable graphs, Advances in Graph Theory, B. Bollobás.
8. C. Thomassen, Configurations in graphs of large minimum degree, connectivity or chromatic number, Proc. 3rd International Conference on Combinatorial Mathematics, New York, 1985.
9. Thomassen C. On the number of Hamiltonian cycles in bipartite graphs. Combin. Probab. Comput. 5:1996;437-442.
10. E. Triesch, W. Nolles, J. Vygen, Die Einsatzplannung von Zementmischern und ein Travelling Salesman Problem.
11. Voss H.-J. Cycles and Bridges in Graphs. 1991;Kluwer Academic/Deutcher Verlag der Wissenschaften, Dordrecht/Berlin.