scientific article; zbMATH DE number 932198

DOI10.1002/(SICI)1097-0118(199610)23:2%3C191::AID-JGT10%3E3.0.CO;2-KMaRDI QIDQ4894622zbMATH OpenFDO

Authors Armen S. Asratian

Publication date 1996

zbMATH Keywords

claw-free graphlocally connectedhamiltonian-connected

Mathematics Subject Classification ID

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

Recommendations

• On Hamiltonicity of 3-connected claw-free graphs
• Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected
• Hamiltonian properties of almost locally connected claw-free graphs.
• Hamiltonian connectedness in claw-free graphs

Cited in

(16)

• Every 3-connected distance claw-free graph is Hamilton-connected
• Extremal infinite graph theory
• Hamiltonian properties of almost locally connected claw-free graphs.
• On Hamiltonicity of regular graphs with bounded second neighborhoods
• Extending cycles locally to Hamilton cycles
• A necessary and sufficient condition for connected, locally k-connected k1,3-free graphs to be k-hamiltonian
• On Hamiltonicity of 3-connected claw-free graphs
• scientific article; zbMATH DE number 123835 (Why is no real title available?)
• Connected, locally 2-connected,K1,3-free graphs are panconnected
• Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected
• Polynomially determining spanning connectivity of locally connected line graphs
• Panconnectivity of locally connected claw-free graphs
• Hamiltonian properties of locally connected graphs with bounded vertex degree
• EVERY N₂-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z₃-CONNECTED
• Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
• Hamiltonian connectedness in claw-free graphs

This page was built for publication:

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