Cycle lengths in graphs of given minimum degree

DOI10.1016/J.JCTB.2026.06.003MaRDI QIDQ7306924zbMATH OpenFDO

Authors Yandong Bai, A. Grzesik, Binlong Li, Magdalena Prorok

Publication date 31 July 2026

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTB.2026.06.003

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38)

Cites work

• A strengthening on consecutive odd cycles in graphs of given minimum degree
• A strengthening on odd cycles in graphs of given chromatic number
• A unified proof of conjectures on cycle lengths in graphs
• Cycle lengths and minimum degree of graphs
• Cycles Modulo k
• Cycles of length 0 modulo 4 in graphs
• Cycles of length 2 modulo 3 in graphs
• Extremal numbers for odd cycles
• Graph decomposition with applications to subdivisions and path systems modulo k
• Graphs with a cycle of length divisible by three
• scientific article; zbMATH DE number 3547317 (Why is no real title available?)
• scientific article; zbMATH DE number 1117463 (Why is no real title available?)
• scientific article; zbMATH DE number 867697 (Why is no real title available?)
• Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two
• On graphs without cycles of length 0 modulo 4
• On two cycles of consecutive even lengths
• Pancyclic graphs. I
• Sufficient Conditions for Circuits in Graphs^†
• The extremal function for cycles of length \(\ell\) mod \(k\)

This page was built for publication: Cycle lengths in graphs of given minimum degree

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