Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two
Combinatorics
2020-08-25 v1
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).
Cite
@article{arxiv.2008.09783,
title = {Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two},
author = {Shuya Chiba and Katsuhiro Ota and Tomoki Yamashita},
journal= {arXiv preprint arXiv:2008.09783},
year = {2020}
}
Comments
19 pages, 4 figures