Locating any two vertices on Hamiltonian cycles in large graphs (Q776260): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:46, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Locating any two vertices on Hamiltonian cycles in large graphs |
scientific article |
Statements
Locating any two vertices on Hamiltonian cycles in large graphs (English)
0 references
8 July 2020
0 references
Hamiltonian cycle
0 references
Enomoto's conjecture
0 references
regularity lemma
0 references
blow-up lemma
0 references
