A sufficient condition for graphs with large neighborhood unions to be traceable

DOI10.1016/0012-365X(95)00230-TzbMath0869.05041OpenAlexW1983760777MaRDI QIDQ1356426

Shijun Ren

Publication date: 31 August 1997

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

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00230-t

zbMATH Keywords

Hamilton pathtraceableneighborhood unionsLindquester's conjecture

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Leaf number and Hamiltonian \(C_4\)-free graphs ⋮ Spanning paths in graphs ⋮ Spanning paths and cycles in triangle-free graphs ⋮ Minimum degree, leaf number and traceability

Cites Work

• The effects of distance and neighborhood union conditions on hamiltonian properties in graphs
• Unnamed Item

This page was built for publication: A sufficient condition for graphs with large neighborhood unions to be traceable