scientific article; zbMATH DE number 867709

MaRDI QIDQ4873826zbMATH OpenFDO

Authors Ralph Faudree, Ronald Gould, T. E. Lindquester

Publication date 22 April 1996

zbMATH Keywords

adjacency conditionshamiltonian propertiesneighborhood union

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• A generalization of Dirac's theorem for \(K(1,3)\)-free graphs
• Dominating sets and Hamiltonicity in \(K_{1,3}\)-free graphs
• Hamiltonian results inK1,3-free graphs
• Publication:4945895

Cited in

(10)

• On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs
• Claw-free graphs---a survey
• Minimum independent generalized \(t\)-degree and independence number in \(K_{1,r+1}\)-free graphs
• Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
• A generalization of Dirac's theorem for \(K(1,3)\)-free graphs
• Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
• scientific article; zbMATH DE number 4101248 (Why is no real title available?)
• scientific article; zbMATH DE number 637321 (Why is no real title available?)
• 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected
• Hamilton paths in \(\{K_{1,4},K_{1,4}+e\}\)-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 Q4873826)