On the girth of hamiltonian weakly pancyclic graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199711)26:3<165::AID-JGT7>3.0.CO;2-P" /><165::AID-JGT7>3.0.CO;2-P 10.1002/(SICI)1097-0118(199711)26:3<165::AID-JGT7>3.0.CO;2-PzbMath0888.05039OpenAlexW4233175382MaRDI QIDQ4364810

Béla Bollobás, Andrew G. Thomason

Publication date: 1 June 1998

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199711)26:3<165::aid-jgt7>3.0.co;2-p

zbMATH Keywords

cyclegirthHamiltonian weakly pancyclic graph

Mathematics Subject Classification ID

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

Related Items (9)

Finding cycles and trees in sublinear time ⋮ Short loop decompositions of surfaces and the geometry of Jacobians ⋮ Vertex-disjoint cycles of the same length. ⋮ Short homotopically independent loops on surfaces ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Degree with neighborhood conditions and highly Hamiltonian graphs ⋮ The minimal length product over homology bases of manifolds ⋮ Girth of sparse graphs ⋮ Disjoint Chorded Cycles of the Same Length

This page was built for publication: On the girth of hamiltonian weakly pancyclic graphs