One sufficient condition for hamiltonian graphs

DOI10.1002/JGT.3190140414MaRDI QIDQ5752604zbMATH OpenOpenAlexFDO

Authors Guantao Chen

Publication date 1990

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

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

zbMATH Keywords

2-connected graphHamiltonian cycle

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites work

• Graph theory with applications

Cited in

(8)

• Neighborhood unions and Hamiltonian properties
• Any maximal planar graph with only one separating triangle is Hamiltonian
• One sufficient condition for Hamiltonian graphs involving distances
• Neighborhood unions and cyclability of graphs
• A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs
• scientific article; zbMATH DE number 205869 (Why is no real title available?)
• scientific article; zbMATH DE number 861334 (Why is no real title available?)
• Four sufficient conditions for hamiltonian graphs

This page was built for publication: One sufficient condition for hamiltonian graphs

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