Sufficient Conditions for Graphsto be (a,b,n)-Critical Graphs
LI Jian-xiang · Mathematica Applicata · 2004
Let G be a graph,and let g and f be two integer-valued functions defined on V(G) such that g(x)≤f(x) for all x∈V(G).A graph G is called a (g,f,n)-critical graph if after deleting any n vertices of G the remaining graph of G has a (g,f)-factor.In this paper three sufficient conditions are given,which are degree condition and neighborhood condition for graph G to be an (a,b,n)-critical graph.Furthermore,it is shown that results in this paper are sharp.