Hamiltonian graphs involving distances

DOI10.1002/JGT.3190160203MaRDI QIDQ4013414zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

distancecycledegreehamiltonian graphsneighbourhood

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(4)

• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• One sufficient condition for Hamiltonian graphs involving distances
• scientific article; zbMATH DE number 1506436 (Why is no real title available?)
• Hamiltonian paths, unit-interval complexes, and determinantal facet ideals

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)