Hostname: page-component-8448b6f56d-mp689 Total loading time: 0 Render date: 2024-04-19T01:18:53.958Z Has data issue: false hasContentIssue false
  • English
  • Français

Hamilton Cycles in Oriented Graphs

Published online by Cambridge University Press:  12 September 2008

Roland Häggkvist
Roland Häggkvist
Affiliation:
Department of Mathematics, University of Umeå, S-901 87 Umeå, Sweden
Get access Rights & Permissions [Opens in a new window]

Abstract

It is shown that an oriented graph of order n whose every indegree and outdegree is at least cn is hamiltonian if c ≥ ½ − 2−15 but need not be if c < ⅜.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 2 , Issue 1 , March 1993 , pp. 25 - 32
Copyright
Copyright © Cambridge University Press 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Bondy, J. A. and Murty, U. S. R. (1976) Graph Theory with Applications, Macmillan and American Elsevier.CrossRefGoogle Scholar
[2]Häggkvist, R. (1983) 9th British Combinatorial Conference, Southampton.Google Scholar
[3]Häggkvist, R. and Manoussakis, Y. (1989) Cycles and paths in bipartite tournaments with spanning configurations. Combinatorica 9 33–38.CrossRefGoogle Scholar
[4]Hajnal, A. and Szeméredi, E. (1970) Proof of a conjecture of Erdős. In: Erdős, P. et al. (eds.), Combinatorial Theory and its Applications II. Colloq. Math. Soc. J. Bolyai 4, North–Holland 601–623.Google Scholar
[5]Jackson, W. (1981) Long paths and cycles in oriented graphs. Journal of Graph Theory 5 145–157.CrossRefGoogle Scholar
[6]Thomassen, C. (1981) Long cycles in digraphs. Proc. London Math. Soc. (3) 42 231–251.Google Scholar
[7]Thomassen, C. (1979) Long cycles in digraphs with constraints on degrees. In: Bollobás, B. (ed.) Survey in Combinatorics, Proceedings of the 7th British Combinatorial Conference. London Math. Soc. Lecture Notes 38, Cambridge University Press 211–228.Google Scholar