How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity? (Q1961765): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s003730050080 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2109790328 / rank | |||
Normal rank | |||
Latest revision as of 01:56, 20 March 2024
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
