Every 3-connected, essentially 11-connected line graph is Hamiltonian (Q3576722)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 5763219
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every 3-connected, essentially 11-connected line graph is Hamiltonian |
scientific article; zbMATH DE number 5763219 |
Statements
30 July 2010
0 references
line graph
0 references
claw-free graph
0 references
supereulerian graphs
0 references
collapsible graph
0 references
Hamiltonian graph
0 references
dominating Eulerian subgraph
0 references
essential connectivity
0 references
0.9950041174888612
0 references
0.9407659769058228
0 references
0.9052496552467346
0 references
0.8913914561271667
0 references
0.8793847560882568
0 references
