SOME RESULTS ON TOUGHNESS AND FRACTIONAL PERFECT MATCHINGS
Yinghong Ma · Journal of Shandong University · 2002
The relationships between toughness and fractional vertices-deletable or fractional edge-deletable graphs were studied.If the toughness of G with order p(p≥2k+2,k≥1) is greater than k+12,then G is fractional 2k-vertices-deletable and also is fractional 2k-edge-deletable;The results in this paper are best possible.