Neighborhood unions and a generalization of Dirac's theorem

DOI10.1016/0012-365X(92)90132-YzbMath0778.05055MaRDI QIDQ1199474

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

Publication date: 16 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

pathscyclesmatchingsHamiltonicityHamiltonian graphsOre's conditionneighborhood union conditions

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Neighborhood unions and hamilton cycles ⋮ On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs ⋮ A generalization of Dirac's theorem for \(K(1,3)\)-free graphs ⋮ A generalization of Ore's Theorem involving neighborhood unions ⋮ Extremal problems and generalized degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New sufficient conditions for cycles in graphs
• Neighbourhood unions and Hamiltonian properties in graphs
• A remark on Hamiltonian cycles
• Note on Hamilton Circuits
• The effects of distance and neighborhood union conditions on hamiltonian properties in graphs
• A new sufficient condition for hamiltonian graphs
• Extremal problems involving neighborhood unions
• Some Theorems on Abstract Graphs

This page was built for publication: Neighborhood unions and a generalization of Dirac's theorem