scientific article; zbMATH DE number 4101248

MaRDI QIDQ3826604zbMATH OpenFDO

Authors Evelyne Flandrin, Irene Fournier, Anne Germa

Publication date 1989

zbMATH Keywords

\(K_{1,3}\)-free graphscircumferenceHamiltonian circuits

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• A note on hamiltonian cycles in \(K_{1,r}\)-free graphs
• Publication:4945895
• Dominating sets and Hamiltonicity in \(K_{1,3}\)-free graphs
• scientific article; zbMATH DE number 867709
• Hamiltonicity for K_{1, r}‐free graphs

Cited in

(7)

• Claw-free graphs---a survey
• Disjoint cliques in claw-free graphs
• A generalization of Dirac's theorem for \(K(1,3)\)-free graphs
• Hamiltonicity for K_{1, r}‐free graphs
• scientific article; zbMATH DE number 1424871 (Why is no real title available?)
• Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs
• The circumference of a graph with no \(K_{3,t}\)-minor

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