A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
For an undirected simple graph G, a variation of toughness is defined as if G is not complete, and τ(G) = ∞ if G is complete. In this paper, we determine the connected graph families F such that every large enough connected F -free graph is τ-tough.doi:10.12785/msl/030317 fatcat:hql6453wlnfkbcaemxqxzrhwne