How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity? (Q1961765)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity? |
scientific article |
Statements
How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity? (English)
0 references
5 July 2000
0 references
semicomplete multipartite digraph
0 references
irregularity
0 references
Hamiltonian
0 references
tournaments
0 references
