A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian

Discrete Mathematics

Volumn 161, Issue 1-3, 1996, Pages 1-12

  Bang Jensen, Jørgen ^a   Gutin, Gregory ^a   Huang, Jing ^b  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041321882     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00272-X     Document Type: Article

References (16)

1. J. Bang-Jensen and C. Thomassen, A polynomial algorithm for the 2-path problem for semicomplete digraphs, SIAM J. Discrete Math. 5 (1992) 366-376.
2. L.W. Beineke, A tour through tournaments or bipartite and ordinary tournaments: a comparative survey, J. London Math. Soc. Lecture Notes Ser. No. 52 (1981) 41-55.
3. L.W. Beineke and R.J. Wilson, Selected Topics in Graph Theory 3 (Academic Press, New York, 1988).
4. J.A. Bondy, Disconnected orientations and a conjecture of Las Vergnas, J. London Math. Soc. 14 (1976) 277-282.
5. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (Macmillan, New York, 1976).
6. G. Gutin, A criterion for complete bipartite digraphs to be Hamiltonian, Vestsi Acad. Navuk BSSR Ser. Fiz.-Mat. Navuk No. 1 (1984) 99-100 (in Russian).
7. G. Gutin, Effective characterization of complete bipartite digraphs that have a Hamiltonian path, Kibernetica No. 4 (1985) 124-125 (in Russian).
8. G. Gutin, A characterization of complete n-partite digraphs that have a Hamiltonian path, Kibernetica No. 1 (1988) 107-108 (in Russian).
9. G. Gutin, Finding a longest path in a complete multipartite digraph, SIAM J. Discrete Math. 6 (1993) 270-273.
10. G. Gutin, Paths and cycles in digraphs, Ph.D. thesis, Tel Aviv Univ., 1993.
11. G. Gutin, Cycles and paths in semicomplete multipartite digraphs, theorems and algorithms: a survey, J. Graph Theory 19 (1995) 481-505.
12. R. Häggkvist and Y. Manoussakis, Cycles and paths in bipartite tournaments with spanning configurations, Combinatorica 9 (1989) 33-38.
13. Y. Manoussakis, A linear algorithm for finding Hamiltonian cycles in tournaments, Discrete Applied Math. 36 (1992) 199-202.
14. J.W. Moon, Topics on Tournaments (Holt, Rinehart and Winston, New York, 1968).
15. A. Yeo, One-diregular subgraphs in semicomplete multipartite digraphs, Journal of Graph Theory, to appear.
16. C.Q. Zhang, Hamilton paths in multipartite oriented graphs, Ann. Discrete Math. 41 (1989) 499-514.