Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs (Q2891038)
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: Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs |
scientific article; zbMATH DE number 6045735
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs |
scientific article; zbMATH DE number 6045735 |
Statements
Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs (English)
0 references
13 June 2012
0 references
line graph
0 references
4-connected
0 references
Hamiltonian
0 references
Hamilton-connected
0 references
dominating cycle
0 references
Thomassen's conjecture
0 references
snark
0 references
0 references
0 references
0.88114315
0 references
0.88010013
0 references
0.87682337
0 references
0 references
0.87195534
0 references
0.8717088
0 references
0.86322534
0 references
