Volume 33 • Number 3 • 2010   • Degree Conditions of Fractional ID-k-Factor-Critical Graphs Renying Chang, Guizhen Liu and Yan Zhu Abstract. We say that a simple graph G is fractional independent-set-deletable k-factor-critical, shortly, fractional ID-k-factor-critical, if G-I has a fractional k-factor for every independent set I of G. Some sufficient conditions for a graph to be fractional ID-k-factor-critical are studied in this paper. Furthermore, we show that the result is best possible in some sense. 2010 Mathematics Subject Classification: 05C70. Full text: PDF