Forbidden subgraphs and 2‐factors in 3/2‐tough graphs
Masahiro Sanka · Journal of Graph Theory · 2022
Abstract A graph is ‐free if it has no induced subgraph isomorphic to , where is a graph. In this paper, we show that every ‐tough ‐free graph has a 2‐factor. The toughness condition of this result is sharp. Moreover, for any there exists a ‐tough ‐free graph without a 2‐factor. This implies that the graph is best possible for a forbidden subgraph in a sense.