An explicit construction of graphs of bounded degree that are far from being Hamiltonian (Q5864726)
From MaRDI portal
scientific article; zbMATH DE number 7538444
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An explicit construction of graphs of bounded degree that are far from being Hamiltonian |
scientific article; zbMATH DE number 7538444 |
Statements
An explicit construction of graphs of bounded degree that are far from being Hamiltonian (English)
0 references
8 June 2022
0 references
Hamiltonian cycle
0 references
property testing
0 references
bounded-degree graphs
0 references
bounded-degree model
0 references
lower bound
0 references
0 references
0 references
0 references
0 references
