Sufficient Conditions for (a,b,k)-Critical Graphs
Sizhong Zhou · Journal of Jilin University · 2005
Let G be a graph of order n,and let a,b,k be integers with 1≤ab,k≥0.If any k vertices of G are deleted,the mained graph has an -factor,then G is called as(a,b,k)-critical graph.In this(paper),the relationships between the minimum degree and(a,b,k)-critical graph as well as toughness and((a,b,k))-critical graph are discussed.Some sufficient conditions of graphs to be(a,b,k)-critical graphs are given.