Lower bounds of length of longest cycles in graphs involving neighborhood unions

DOI10.1016/0012-365X(95)00226-MzbMath0879.05046MaRDI QIDQ1357727

Xin Liu

Publication date: 12 January 1998

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

zbMATH Keywords

degree boundcircumferencelongest cyclehamiltonicityneighbourhood union

Mathematics Subject Classification ID

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

Related Items (2)

Length of longest cycles in a graph whose relative length is at least two ⋮ Spanning paths in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A generalization of Ore's Theorem involving neighborhood unions
• Long dominating cycles and paths in graphs with large neighborhood unions
• Extremal problems involving neighborhood unions

This page was built for publication: Lower bounds of length of longest cycles in graphs involving neighborhood unions