Every 3-connected, essentially 11-connected line graph is Hamiltonian (Q2496206)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every 3-connected, essentially 11-connected line graph is Hamiltonian |
scientific article |
Statements
Every 3-connected, essentially 11-connected line graph is Hamiltonian (English)
0 references
12 July 2006
0 references
claw-free graph
0 references
super-Eulerian graphs
0 references
collapsible graph
0 references
Hamiltonian graph
0 references
dominating Eulerian subgraph
0 references
essential connectivity
0 references
