Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian (Q1970581)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian |
scientific article |
Statements
Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian (English)
0 references
5 September 2000
0 references
A semicomplete multipartite digraph is obtained by replacing each edge of a complete multipartite graph by an arc or by a pair of mutually opposite arcs. While in 1984 the reviewer characterized Hamiltonian semicomplete bipartite digraphs, no such characterization is known for semicomplete multipartite digraphs. The authors prove an interesting sufficient condition for Hamiltonicity of semicomplete multipartite digraphs.
0 references
semicomplete multipartite digraph
0 references
Hamiltonicity
0 references
