Long cycles, degree sums and neighborhood unions

DOI10.1016/0012-365X(93)90534-ZzbMath0791.05063OpenAlexW1986662362MaRDI QIDQ1309446

Hajo J. Broersma, Henk Jan Veldman, Jan van den Heuvel

Publication date: 4 July 1994

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90534-z

zbMATH Keywords

neighborhood union1-tough graphlongest cycleshamiltonian cycles

Mathematics Subject Classification ID

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

Related Items (3)

Cycles through subsets with large degree sums ⋮ A note on dominating cycles in 2-connected graphs ⋮ Toughness in graphs -- a survey

Cites Work

• Long cycles in graphs with large degree sums
• Hamiltonism, degree sum and neighborhood intersections
• Hamiltonian properties of graphs with large neighborhood unions
• On Maximal Circuits in Finite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Long cycles, degree sums and neighborhood unions