A necessary and sufficient condition for connected, locally k-connected k1,3-free graphs to be k-hamiltonian

DOI10.1002/jgt.3190130602zbMath0702.05056OpenAlexW2023946084MaRDI QIDQ3480080

Huai-Lu Zhou

Publication date: 1989

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190130602

zbMATH Keywords

connectivityk-Hamiltonianlocally k-connected \(K_{1,3}\)-free graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items

Claw-free graphs---a survey

Cites Work

• Unnamed Item