A proof of a conjecture about \(D_ \lambda\)-paths in graphs with large neighborhood unions

DOI10.1016/0012-365X(95)00224-KzbMath0869.05040WikidataQ122900315 ScholiaQ122900315MaRDI QIDQ1356422

Jianping Li, Feng Tian

Publication date: 31 August 1997

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

zbMATH Keywords

distanceHamiltonian pathneighborhood unionstraceable graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• New sufficient conditions for cycles in graphs
• Existence of Dlambda-cycles and Dlambda-paths
• Neighbourhood unions and Hamiltonian properties in graphs
• Hamiltonian properties of graphs with large neighborhood unions
• Note on Hamilton Circuits
• The effects of distance and neighborhood union conditions on hamiltonian properties in graphs

This page was built for publication: A proof of a conjecture about \(D_ \lambda\)-paths in graphs with large neighborhood unions