paper

Hamiltonian cycles in 3-tough -free graphs

arXiv:1706.09029

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.

References in corpus (1)

Cited by in corpus (1)