A note on locally connected and Hamiltonian-connected graphs

DOI10.1007/BF02760528MaRDI QIDQ1132896zbMATH OpenFDO

Authors Gary Chartrand, Ronald Gould, Albert D. Polimeni

Publication date 1979

Published in Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02760528

zbMATH Keywords

Hamiltonian-connected graphslocally connected

Mathematics Subject Classification ID

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

Cites work

• Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
• scientific article; zbMATH DE number 3625415 (Why is no real title available?)
• Locally connected graphs

Cited in

(10)

• Panconnectivity of locally connected claw-free graphs
• Claw-free graphs---a survey
• Global cycle properties of locally isometric graphs
• Global cycle properties in locally connected, locally traceable and locally Hamiltonian graphs
• On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints
• Full cycle extendability of locally connected \(K_{1,4}\)-restricted graphs
• Global cycle properties in graphs with large minimum clustering coefficient
• Hamiltonian connectedness in claw-free graphs
• Hamiltonian properties of locally connected graphs with bounded vertex degree
• Path extendable graphs

This page was built for publication: A note on locally connected and Hamiltonian-connected graphs

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