A Neighborhood Union Condition for Graphs to Be Fractional (k,n)-Critical
Tang Siping · Shuxue de shijian yu renshi · 2010
Let G be a graph,and let k be nonnegative integer with 1≤k.A graph G is called a fractional(k,n)-critical graph if after deleting any n vertices of G the remaining graph of G has a fractional k-factor.In this paper a neighborhood union condition for graphs to be fractional(k,n)-critical is given,and the condition is sharp.