One sufficient condition for Hamiltonian graphs involving distances

DOI10.3103/S1066369X12040056zbMath1276.05068OpenAlexW1973033130MaRDI QIDQ1759263

Kewen Zhao, Ping Zhang, Yue Lin

Publication date: 20 November 2012

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

Full work available at URL: https://doi.org/10.3103/s1066369x12040056

zbMATH Keywords

Ore conditionChen conditiondistance 2neighborhood union and degree condition

Mathematics Subject Classification ID

Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Cites Work

• Neighbourhood unions and Hamiltonian properties in graphs
• Hamiltonian properties of graphs with large neighborhood unions
• Note on Hamilton Circuits
• One sufficient condition for hamiltonian graphs

This page was built for publication: One sufficient condition for Hamiltonian graphs involving distances