A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian (Q1356402)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian |
scientific article |
Statements
A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian (English)
0 references
17 September 1997
0 references
multipartite tournament
0 references
digraph
0 references
factor
0 references
Hamiltonian
0 references
paths
0 references
cycles
0 references
0 references
