TOUGHNESS AND DEGREE CONDITION FOR FRACTIONAL ID-k-FACTOR-CRITICAL GRAPHS
YUAN YUAN, Zhiren Sun · Discrete Mathematics Algorithms and Applications · 2014
A graph G is fractional independent-set-deletable k-factor-critical if G-I has a fractional k-factor for every independent set I of G. In this paper, we prove that if |V(G)| ≥ k + 2, [Formula: see text] and t(G) ≥ k2 + 6k, then G is fractional ID-k-factor-critical.