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

DOI10.1016/S0012-365X(02)00687-8zbMath1018.05061OpenAlexW2015368761MaRDI QIDQ1398263

Rao Li, Richard 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

distanceconnectivityclaw-free graphHamilton-connectedfinite unidirected graph

Mathematics Subject Classification ID

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

Related Items

Recent advances on the Hamiltonian problem: survey III