Hamiltonian graphs involving distances

DOI10.1002/JGT.3190160203zbMATH Open0766.05053OpenAlexW2024430751MaRDI QIDQ4013414FDOQ4013414

Authors: Guantao Chen, R. H. Schelp 

Publication date: 27 September 1992

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190160203

Recommendations

• One sufficient condition for Hamiltonian graphs involving distances
• A short proof of a theorem on Hamiltonian graphs
• scientific article; zbMATH DE number 165081
• Neighborhood unions and hamiltonicity of graphs
• scientific article; zbMATH DE number 1322572

zbMATH Keywords

distancecycledegreehamiltonian graphsneighbourhood

Mathematics Subject Classification ID

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

Cites Work

• Graph theory with applications
• A generalization of Ore's Theorem involving neighborhood unions
• A sufficient condition for a graph to be Hamiltonian

Cited In (4)

• One sufficient condition for Hamiltonian graphs involving distances
• Hamiltonian paths, unit-interval complexes, and determinantal facet ideals
• Title not available (Why is that?)
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey

This page was built for publication: Hamiltonian graphs involving distances

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