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

Songling Shan

paper

Hamiltonian cycles in 3-tough $2 K_{2}$ -free graphs

arXiv:1706.09029

Abstract

A graph is called $2 K_{2}$ -free if it does not contain two independent edges as an induced subgraph. Broersma, Patel, and Pyatkin showed that every 25-tough $2 K_{2}$ -free graph with at least three vertices is hamiltonian. In this paper, we improve the required toughness in this result from 25 to 3.

Cited by in corpus (1)

Hamiltonian cycles in tough $(P_{2} \cup P_{3})$ -free graphs

Hamiltonian cycles in 3-tough 2K2​-free graphs

Abstract

Cited by in corpus (1)

Hamiltonian cycles in 3-tough $2 K_{2}$ -free graphs