Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two
Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two
复制标题
DOI：
10.1002/jgt.22921
复制
发表时间：
2020-08
影响因子：
0.9
通讯作者：
S. Chiba;K. Ota;T. Yamashita
中科院分区：
文献类型：
--
作者：
S. Chiba;K. Ota;T. Yamashita
Gao, Huo, Liu，和Ma证明了一个结果，即连接两个长度相差1或2的指定顶点的路径存在。利用这一结果，他们解决了托马森提出的两个著名猜想。在本文中，我们改进了他们的结果，得到了Bondy和Vince的结果的推广。
Gao, Huo, Liu, and Ma 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. In this paper, we improve their result, and obtain a generalization of a result of Bondy and Vince.