A generalization of Dirac's theorem for \(K(1,3)\)-free graphs

DOI10.1007/BF02651085zbMath0784.05042OpenAlexW1994517498MaRDI QIDQ1813059

T. E. Lindquester, Ronald J. Gould, Michael S. Jacobson, Ralph J. Faudree, Linda Lesniak

Publication date: 25 June 1992

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

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

zbMATH Keywords

traceabilitypancyclicityDirac's theoremhamiltonian- connectednessK(1,3)-free graphs

Mathematics Subject Classification ID

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

Related Items (2)

Dominating sets and Hamiltonicity in \(K_{1,3}\)-free graphs ⋮ Neighborhood unions and the cycle cover number of a graph

Cites Work

• Unnamed Item
• Neighbourhood unions and Hamiltonian properties in graphs
• On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs
• Neighborhood unions and a generalization of Dirac's theorem
• Longest paths and cycles in K1,3-free graphs
• Some Theorems on Abstract Graphs

This page was built for publication: A generalization of Dirac's theorem for \(K(1,3)\)-free graphs