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)
A multipartite tournament is an orientation of a complete k-partite graph for some k 2. A factor of...
A multipartite tournament is an orientation of a complete k-partite graph for some k 2. A factor of...
A multipartite tournament is an orientation of a complete k-partite graph for some k 2. A factor of...
We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite d...
We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite d...
We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite d...
We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite d...
We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite d...
We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite d...
AbstractA semicomplete multipartite digraph is obtained by replacing each edge of a complete multipa...
The problem of finding necessary and sufficient conditions for a semicomplete multipartite digraphs ...
AbstractWe survey results on the sequential and parallel complexity of hamiltonian path and cycle pr...
AbstractWe survey results on the sequential and parallel complexity of hamiltonian path and cycle pr...
We consider the problem (MSSS) of finding the minimum number of arcs in a spanning strongly connecte...
A multipartite tournament is an orientation of a complete k-partite graph for some k 2. A factor of...
A multipartite tournament is an orientation of a complete k-partite graph for some k 2. A factor of...
A multipartite tournament is an orientation of a complete k-partite graph for some k 2. A factor of...
A multipartite tournament is an orientation of a complete k-partite graph for some k 2. A factor of...
We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite d...
We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite d...
We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite d...
We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite d...
We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite d...
We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite d...
AbstractA semicomplete multipartite digraph is obtained by replacing each edge of a complete multipa...
The problem of finding necessary and sufficient conditions for a semicomplete multipartite digraphs ...
AbstractWe survey results on the sequential and parallel complexity of hamiltonian path and cycle pr...
AbstractWe survey results on the sequential and parallel complexity of hamiltonian path and cycle pr...
We consider the problem (MSSS) of finding the minimum number of arcs in a spanning strongly connecte...
A multipartite tournament is an orientation of a complete k-partite graph for some k 2. A factor of...
A multipartite tournament is an orientation of a complete k-partite graph for some k 2. A factor of...
A multipartite tournament is an orientation of a complete k-partite graph for some k 2. A factor of...
A multipartite tournament is an orientation of a complete k-partite graph for some k 2. A factor of...
DOI
Add to ORKG