Hamiltonian cycles in 2-tough $2K_2$-free graphs

Katsuhiro Ota, Masahiro Sanka

A graph $G$ is called a $2K_2$-free graph if it does not contain $2K_2$ as an induced subgraph. In 2014, Broersma, Patel and Pyatkin showed that every 25-tough $2K_2$-free graph on…