scientific article; zbMATH DE number 637321

MaRDI QIDQ4304374zbMATH OpenFDO

Authors L. R. Markus

Publication date 27 November 1994

zbMATH Keywords

claw-free graphHamilton cyclesminimum degree condition

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Hamiltonicity for K_{1, r}‐free graphs
• scientific article; zbMATH DE number 1161288
• Hamiltonian results inK1,3-free graphs
• A note on hamiltonian cycles in \(K_{1,r}\)-free graphs
• scientific article; zbMATH DE number 1281388
• The Hamiltonian properties in \(K_{1,r}\)-free split graphs
• Publication:4945895
• On Hamiltonian properties of \(K_{1, r}\)-free split graphs
• scientific article; zbMATH DE number 867709
• scientific article; zbMATH DE number 1750093

Cited in

(16)

• Hamiltonicity of \(\{K_{1,4},K_{1,4}+e\}\)-free graphs
• Claw-free graphs---a survey
• On hamiltonian connectedness of \(K_{1,4}\)-free graphs
• Spanning spiders and light-splitting switches
• On weights of induced paths and cycles in claw-free and \(K_{1,r}\)-free graphs
• A note on hamiltonian cycles in \(K_{1,r}\)-free graphs
• Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path
• scientific article; zbMATH DE number 5778154 (Why is no real title available?)
• Extremal problems for forbidden pairs that imply hamiltonicity
• scientific article; zbMATH DE number 1156672 (Why is no real title available?)
• scientific article; zbMATH DE number 1161288 (Why is no real title available?)
• Hamiltonicity for K_{1, r}‐free graphs
• scientific article; zbMATH DE number 4183448 (Why is no real title available?)
• A spanning tree with at most \(k\) leaves in a \(K_{1,p}\)-free graph
• Spanning connectivity of \(K_{1 , r}\)-free split graphs
• A spanning tree with at most \(k\) leaves in a \(K_{1,5}\)-free graph

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 Q4304374)