Random directed graphs are robustly Hamiltonian (Q2820274): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W217363743 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1404.4734 / rank | |||
Normal rank | |||
Latest revision as of 09:42, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Random directed graphs are robustly Hamiltonian |
scientific article |
Statements
Random directed graphs are robustly Hamiltonian (English)
0 references
15 September 2016
0 references
random digraph
0 references
Hamilton cycle
0 references
resilience
0 references
