9-connected claw-free graphs are Hamilton-connected (Q1305527)
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: 9-connected claw-free graphs are Hamilton-connected |
scientific article; zbMATH DE number 1346891
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 9-connected claw-free graphs are Hamilton-connected |
scientific article; zbMATH DE number 1346891 |
Statements
9-connected claw-free graphs are Hamilton-connected (English)
0 references
27 February 2000
0 references
A graph \(G\) is claw-free if no induced subgraph of \(G\) is isomorphic to \(K_{1,3}\). Further, a graph is Hamilton-connected if any pair of its vertices is joined by a Hamiltonian path. The author shows that every 9-connected claw-free graph is Hamilton-connected.
0 references
Hamilton-connected
0 references
claw-free
0 references
0 references
0.9053478
0 references
0.90195537
0 references
0.90195537
0 references
0.8907169
0 references
0.8883625
0 references
0.88823605
0 references
0.8869709
0 references
