A Unified Proof of Conjectures on Cycle Lengths in Graphs

DOI10.1093/imrn/rnaa324zbMath1496.05040arXiv1904.08126OpenAlexW3120197697WikidataQ123014072 ScholiaQ123014072MaRDI QIDQ5082279

Jie Ma, Jun Gao, Chun-Hung Liu, Qingyi Huo

Publication date: 16 June 2022

Published in: International Mathematics Research Notices (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.08126

zbMATH Keywords

pathscycles

Mathematics Subject Classification ID

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

Related Items (7)

Linear cycles of consecutive lengths ⋮ Divisible subdivisions ⋮ Cycles of many lengths in Hamiltonian graphs ⋮ Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two ⋮ How to build a pillar: a proof of Thomassen's conjecture ⋮ A Strengthening on Odd Cycles in Graphs of Given Chromatic Number ⋮ On a conjecture of Bondy and Vince

This page was built for publication: A Unified Proof of Conjectures on Cycle Lengths in Graphs