Every 3-connected distance claw-free graph is Hamilton-connected

DOI10.1016/S0012-365X(02)00687-8MaRDI QIDQ1398263zbMATH OpenOpenAlexFDO

Authors Rao Li, R. H. Schelp

Publication date 29 July 2003

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(02)00687-8

zbMATH Keywords

claw-free graphconnectivitydistancefinite unidirected graphHamilton-connected

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Review text

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.

Recommendations

• Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected
• scientific article; zbMATH DE number 932198
• Hamiltonicity in 3-connected claw-free graphs
• On Hamiltonicity of 3-connected claw-free graphs
• Every 3-connected claw-free \(Z_{8}\)-free graph is Hamiltonian
• Claw-free 3-connectedP11-free graphs are hamiltonian
• Hamiltonicity and minimum degree in 3-connected claw-free graphs
• Hamiltonian connectedness in claw-free graphs
• Hamiltonian connectedness in claw-free graphs
• Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected

Cited in

(3)

• Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected
• Recent advances on the Hamiltonian problem: survey III
• EVERY N₂-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z₃-CONNECTED

This page was built for publication: Every 3-connected distance claw-free graph is Hamilton-connected

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1398263)