Abstract
AbstractLet G be a graph of order n. Let a, b and k be nonnegative integers such that 1≤a≤b. A graph G is called an (a,b,k)-critical graph if after deleting any k vertices of G the remaining graph of G has an [a,b]-factor. We provide a sufficient condition for a graph to be (a,b,k)-critical that extends a well-known sufficient condition for the existence of a k-factor.
Publisher
Cambridge University Press (CUP)
Reference10 articles.
1. k-factors and extendability with prescribed components;Liu;Congr. Numer.,1999
2. [10] Zhou S. and Zong M. , ‘Some new sufficient conditions for graphs to be (a,b,k)-critical graphs’, Ars Combin. to appear.
3. Some sufficient conditions for graphs to have (g, f)-factors
4. k
-Factors and Neighbourhoods of Independent Sets in Graphs
5. On k-factor-critical graphs
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献