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

Shuya Chiba, Katsuhiro Ota, Tomoki Yamashita

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)340-358
Number of pages19
JournalJournal of Graph Theory
Volume103
Issue number2
DOIs
Publication statusPublished - 2023 Jun

Keywords

  • cycle length
  • minimum degree
  • path length

ASJC Scopus subject areas

  • Geometry and Topology
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two'. Together they form a unique fingerprint.

Cite this