A weakly pancyclic theorem for Hamiltonian non-bipartite graphs

MaRDI QIDQ3640348zbMATH OpenFDO

Authors Fangguo He, Zhiquan Hu

Publication date 11 November 2009

zbMATH Keywords

non-bipartite graphHamiltonian graphweakly pancyclic graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Recommendations

• Weakly pancyclic graphs
• Degree with neighborhood conditions and highly Hamiltonian graphs
• Weakly pancyclic graphs
• On the girth of hamiltonian weakly pancyclic graphs
• scientific article; zbMATH DE number 3902696

Cited in

(2)

• Weakly pancyclic graphs
• Estimates on the size of the cycle spectra of Hamiltonian graphs

This page was built for publication: A weakly pancyclic theorem for Hamiltonian non-bipartite graphs

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