A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs

Authors:
Jørgen Bang–Jensen;Gregory Gutin;Anders Yeo
Affiliations:
Department of Mathematics and Computer Science, Odense University, DK-5230, Odense, Denmark;Department of Mathematics and Statistics, Brunel University, Uxbridge, Middlesex UP8 3PH United Kingdom;Department of Mathematics and Computer Science, Odense University, DK-5230, Odense, Denmark
Venue:
Journal of Graph Theory
Year:
1998

Citing 0
Cited 5

Cycles in multipartite tournaments: results and problems

Discrete Mathematics
Orientations of digraphs almost preserving diameter

Discrete Applied Mathematics
Minimum cycle factors in quasi-transitive digraphs

Discrete Optimization
Reduced-by-matching Graphs: Toward Simplifying Hamiltonian Circuit Problem

Fundamenta Informaticae
Quasi-hamiltonian paths in semicomplete multipartite digraphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite digraphs. The existence of such an algorithm was conjectured in G. Gutin, Paths and cycles in digraphs. Ph. D. thesis, Tel Aviv Univ., 1993. (see also G. Gutin, J Graph Theory 19 (1995) 481–505). © 1998 John Wiley & Sons, Inc. J. Graph Theory 29: 111–132, 1998