The number of cycle lengths in graphs of given minimum degree and girth

DOI10.1016/S0012-365X(98)00324-0zbMath0934.05076OpenAlexW2018977735MaRDI QIDQ1301632

Cecil C. Rousseau, Richard H. Schelp, Ralph J. Faudree

Publication date: 10 April 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00324-0

zbMATH Keywords

lower boundgirthminimum degreecycle lengths

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (8)

Cycles of many lengths in Hamiltonian graphs ⋮ Cycle spectra of Hamiltonian graphs ⋮ Circumference, chromatic number and online coloring ⋮ The lattice of cycles of an undirected graph ⋮ Cycle lengths in sparse graphs ⋮ Cycle lengths in expanding graphs ⋮ Ranking hypotheses to minimize the search cost in probabilistic inference models ⋮ Cycle lengths modulo \(k\) in expanders

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: The number of cycle lengths in graphs of given minimum degree and girth