Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 340-358 |
Number of pages | 19 |
Journal | Journal of Graph Theory |
Volume | 103 |
Issue number | 2 |
DOIs | |
Publication status | Published - 2023 Jun |
Keywords
- cycle length
- minimum degree
- path length
ASJC Scopus subject areas
- Geometry and Topology
- Discrete Mathematics and Combinatorics