We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
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 < ⅜.
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.)
Article purchase
Temporarily unavailable
References
[1]
[1]Bondy, J. A. and Murty, U. S. R. (1976) Graph Theory with Applications, Macmillan and American Elsevier.CrossRefGoogle Scholar
[2]
[2]Häggkvist, R. (1983) 9th British Combinatorial Conference, Southampton.Google Scholar
[3]
[3]Häggkvist, R. and Manoussakis, Y. (1989) Cycles and paths in bipartite tournaments with spanning configurations. Combinatorica933–38.CrossRefGoogle Scholar
[4]
[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. Bolyai4, North–Holland601–623.Google Scholar
[5]
[5]Jackson, W. (1981) Long paths and cycles in oriented graphs. Journal of Graph Theory5145–157.CrossRefGoogle Scholar
[6]
[6]Thomassen, C. (1981) Long cycles in digraphs. Proc. London Math. Soc. (3) 42231–251.Google Scholar
[7]
[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 Notes38, Cambridge University Press211–228.Google Scholar