MMN-1264
Degree sum condition for fractional ID-$k$-factor-critical graphs
Wei Gao; Weifan Wang;Abstract
A graph $G$ is called a fractional
ID-$k$-factor-critical graph if after deleting any independent set
of $G$ the resulting graph admits a fractional $k$-factor. In this
paper, we prove that for $k\ge2$, $G$ is a fractional
ID-$k$-factor-critical graph if $\delta(G)\ge\frac{n}{3}+k$,
$\sigma_{2}(G)\ge \frac{4n}{3}$, $n\ge6k-8$. The result is best
possible in some sense.
Vol. 18 (2017), No. 2, pp. 751-758