Every 3-connected distance claw-free graph is Hamilton-connected (Q1398263)
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: Every 3-connected distance claw-free graph is Hamilton-connected |
scientific article; zbMATH DE number 1956038
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every 3-connected distance claw-free graph is Hamilton-connected |
scientific article; zbMATH DE number 1956038 |
Statements
Every 3-connected distance claw-free graph is Hamilton-connected (English)
0 references
29 July 2003
0 references
In 1991 \textit{F. B. Shepherd} [J. Comb. Theory, Ser. B 53, 173-194 (1991; Zbl 0776.05055)] stated the following problem: Are all the 4-connected DC graphs Hamilton-connected? The authors of the present paper answer this question affirmatively and prove a stronger statement: Every 3-connected DC graph is Hamilton-connected; and this requirement can not be lowered.
0 references
claw-free graph
0 references
finite unidirected graph
0 references
Hamilton-connected
0 references
distance
0 references
connectivity
0 references
0.9490596
0 references
0.92406005
0 references
0.9201492
0 references
0.9193667
0 references
0.91013545
0 references
0.90902525
0 references
0.8990402
0 references
0.8990402
0 references
