A sufficient condition for fractional ID-[a, b]-factor-critical covered graphs

摘要

A graph G is fractional ID-[a, b]-factor-critical covered if for any independent set I of G, G I is fractional [a, b]-covered. In this article, we present a neighborhood union condition for a graph to be fractional ID-[a, b]-factor-critical covered, and show this result is best possible in some sense.