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

DOI10.1002/JGT.22921zbMATH Open1522.05236arXiv2008.09783OpenAlexW3080332927MaRDI QIDQ6074584FDOQ6074584

Tomoki Yamashita, Katsuhiro Ota, Shuya Chiba

Publication date: 12 October 2023

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

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).

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

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

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)

Cites Work

• Graph decomposition with applications to subdivisions and path systems modulo k
• Cycle lengths and minimum degree of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Unified Proof of Conjectures on Cycle Lengths in Graphs
• On a conjecture of Bondy and Vince

Cited In (1)

• Title not available (Why is that?)

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)