Avoiding Certain Graphs for a Variation of Toughness

Yaya Wang, Xiangguang He, Zhiqun Zhang, Wei Gao
2014 Mathematical Sciences Letters  
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