The effects of distance and neighborhood union conditions on hamiltonian properties in graphs
From MaRDI portal
DOI10.1002/JGT.3190130309zbMATH Open0695.05042OpenAlexW1990901252MaRDI QIDQ3470495FDOQ3470495
Authors: T. E. Lindquester 
Publication date: 1989
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190130309
Recommendations
Cites Work
Cited In (15)
- Neighborhood unions and hamiltonicity of graphs
- Vertex pancyclicity and new sufficient conditions
- Two new sufficient conditions for Hamilton-connected graphs
- Notes on vertex pancyclicity of graphs
- Title not available (Why is that?)
- Proof that pyramid networks are 1-Hamiltonian-connected with high probability
- Neighborhood unions and a generalization of Dirac's theorem
- Neighborhood union conditions for Hamiltonicity of \(P_{3}\)-dominated graphs
- A proof of a conjecture about \(D_ \lambda\)-paths in graphs with large neighborhood unions
- A sufficient condition for graphs with large neighborhood unions to be traceable
- Hamiltonian properties of graphs with large neighborhood unions
- Title not available (Why is that?)
- 2‐neighborhoods and hamiltonian conditions
- A neighborhood condition for vertices at distance two implying Hamiltonicity
- A neigborhood union condition for nonadjacent vertices in graphs
This page was built for publication: The effects of distance and neighborhood union conditions on hamiltonian properties in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3470495)
