NEIGHBOURHOODS OF INDEPENDENT SETS FOR (a,b,k)-CRITICAL GRAPHS
Sizhong Zhou, Yang Xu · Bulletin of the Australian Mathematical Society · 2008
Abstract Let 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.