Hamiltonian cycles in 3‐tough 2 K 2 ‐free graphs
Songling Shan · Journal of Graph Theory · 2019
Abstract A graph is called ‐free if it does not contain two independent edges as an induced subgraph. Broersma, Patel, and Pyatkin showed that every 25‐tough ‐free graph with at least three vertices is Hamiltonian. In this paper, we improve the required toughness in this result from 25 to 3.