Abstract
Purchase PDF (101 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (0)
Purchase PDF (580 K)
23) such that a Hamiltonian cycle exists with probability tending to 1 as 
doi:10.1016/S0012-365X(98)00352-5 
Copyright © 1999 Published by Elsevier Science B.V. All rights reserved.
A sufficient condition for maximum cycles in bipartite digraphs
Received 31 March 1993;
revised 14 November 1997;
accepted 3 August 1998.
Available online 17 September 1999.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
A sufficient condition for the existence of a maximum cycle (i.e. of length twice the cardinality of the smaller color class) in a bipartite digraph is presented. Clearly, the obtained cycle is Hamiltonian whenever the bipartite digraph is balanced. The condition given here is the best possible of its type and it is considerably weaker than those previously known that imply the same conclusion.
Author Keywords: Bipartite digraphs; Maximum cycles; Hamiltonian cycle
Corresponding author. Fellow of the European Commission, Program H. C. & M. Present address: Athens University of Economics and Business, Patission 76, 10434 Athens, Greece; email: milis@softlab.ece.ntua.gr
