Hamiltonian cycles in 2-tough 2K2-free graphs

Katsuhiro Ota, Masahiro Sanka

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


A graph (Formula presented.) is called a (Formula presented.) -free graph if it does not contain (Formula presented.) as an induced subgraph. In 2014, Broersma, Patel, and Pyatkin showed that every 25-tough (Formula presented.) -free graph on at least three vertices is Hamiltonian. Recently, Shan improved this result by showing that 3-tough is sufficient instead of 25-tough. In this paper, we show that every 2-tough (Formula presented.) -free graph on at least three vertices is Hamiltonian, which was conjectured by Gao and Pasechnik.

Original languageEnglish
Pages (from-to)769-781
Number of pages13
JournalJournal of Graph Theory
Issue number4
Publication statusPublished - 2022 Dec


  • 2-factor
  • 2K-free graph
  • Hamiltonian cycle
  • toughness

ASJC Scopus subject areas

  • Geometry and Topology
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Hamiltonian cycles in 2-tough 2K2-free graphs'. Together they form a unique fingerprint.

Cite this