On a conjecture of Bondy and Vince

DOI10.1016/j.jctb.2019.07.005zbMath1430.05062arXiv1902.05701OpenAlexW2963942939MaRDI QIDQ2284740

Jie Ma, Jun Gao

Publication date: 15 January 2020

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

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

zbMATH Keywords

cycle lengthconsecutive cyclesBondy-Vince conjecturegraphs of minimum degree three

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Cycle lengths in sparse graphs
• Non-separating induced cycles in graphs
• Some old and new problems in various branches of combinatorics
• Cycle lengths and minimum degree of graphs
• Distribution of cycle lengths in graphs
• On Arithmetic Progressions of Cycle Lengths in Graphs
• Extremal problems for cycles in graphs
• A Unified Proof of Conjectures on Cycle Lengths in Graphs

This page was built for publication: On a conjecture of Bondy and Vince