Let G be a graph of order n, and let a, b, k be nonnegative integers with 1 ≤ a < b. An [a, b]-factor of graph G is defined as a spanning subgraph F of G such that a ≤ dF(x) ≤ b for each x ϵ V (F). Then 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. In this paper, it is proved that G is an (a, b, k)-critical graph if the binding number
Furthermore, it is showed that the result in this paper is best possible in some sense.