One sufficient condition for Hamiltonian graphs involving distances

DOI10.3103/S1066369X12040056zbMATH Open1276.05068OpenAlexW1973033130MaRDI QIDQ1759263FDOQ1759263

Authors: Kewen Zhao, Yue Lin, Ping Zhang 

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

Recommendations

• Hamiltonian graphs involving distances
• scientific article; zbMATH DE number 1824151
• Sufficient conditions for Hamiltoniancity of certain special graphs
• scientific article; zbMATH DE number 205869
• An efficient condition for a graph to be Hamiltonian

zbMATH Keywords

Ore conditionChen conditiondistance 2neighborhood union and degree condition

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Degree conditions for Hamiltonicity: counting the number of missing edges
• The graphs satisfying conditions of Ore's type
• Hamiltonian graphs involving distances
• Sufficient conditions for Hamiltoniancity of certain special graphs
• An efficient condition for a graph to be Hamiltonian

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1759263)