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

distanceclaw-free graphconnectivityHamilton-connectedfinite unidirected graph

Mathematics Subject Classification ID

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

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)

• Recent advances on the Hamiltonian problem: survey III
• Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected
• 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)