Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two

DOI10.1002/JGT.22921MaRDI QIDQ6074584zbMATH OpenOpenAlexFDO

Authors Shuya Chiba, Katsuhiro Ota, Tomoki Yamashita

Publication date 12 October 2023

Published in Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

minimum degreecycle lengthpath length

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Distance in graphs (05C12) Paths and cycles (05C38)

Abstract: Gao, Huo, Liu and Ma (2019) proved a result on the existence of paths connecting specified two vertices whose lengths differ by one or two. By using this result, they settled two famous conjectures due to Thomassen (1983). In this paper, we improve their result, and obtain a generalization of a result of Bondy and Vince (1998).

Recommendations

• scientific article; zbMATH DE number 2230942
• Distribution of cycle lengths in graphs
• On a conjecture of Bondy and Vince
• A unified proof of conjectures on cycle lengths in graphs
• scientific article; zbMATH DE number 1117463

Cites work

• scientific article; zbMATH DE number 3547317 (Why is no real title available?)
• scientific article; zbMATH DE number 1117463 (Why is no real title available?)
• A unified proof of conjectures on cycle lengths in graphs
• Cycle lengths and minimum degree of graphs
• Graph decomposition with applications to subdivisions and path systems modulo k
• On a conjecture of Bondy and Vince

Cited in

(2)

• A strengthening on consecutive odd cycles in graphs of given minimum degree
• scientific article; zbMATH DE number 6692113 (Why is no real title available?)

This page was built for publication: Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two

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