Hamilton cycles in sparse locally connected graphs (Q1730246)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Hamilton cycles in sparse locally connected graphs |
scientific article; zbMATH DE number 7034228
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hamilton cycles in sparse locally connected graphs |
scientific article; zbMATH DE number 7034228 |
Statements
Hamilton cycles in sparse locally connected graphs (English)
0 references
11 March 2019
0 references
locally connected
0 references
Hamiltonian cycle
0 references
NP-completeness
0 references
polynomial time algorithm
0 references
0.9403268
0 references
0.9379186
0 references
0.9365774
0 references
0.9289917
0 references
0.9240697
0 references
0.91933405
0 references
0.91861427
0 references
