Let $G$ be a graph of order $p$, let $a$, $b$, and $n$ be nonnegative integers with $1\,\le \,a\,<\,b$, and let $g$ and $f$ be two integer-valued functions defined on $V\left( G \right)$ such that $a\,\le \,g\left( x \right)\,<\,f\left( x \right)\,\le \,b$ for all $x\,\in \,V\left( G \right)$. A $\left( g,\,f \right)$-factor of graph $G$ is a spanning subgraph $F$ of $G$ such that $g\left( x \right)\,\le \,{{d}_{F}}\left( x \right)\,\le \,f\left( x \right)$ for each $x\,\in \,V\left( F \right)$. Then a graph $G$ is called $\left( g,\,f,\,n \right)$-critical if after deleting any $n$ vertices of $G$ the remaining graph of $G$ has a $\left( g,\,f \right)$-factor. The binding number $\text{bind}\left( G \right)$ of $G$ is the minimum value of $\left| {{N}_{G}}\left( X \right) \right|/\left| X \right|$ taken over all non-empty subsets $X$ of $V\left( G \right)$ such that ${{N}_{G}}\left( X \right)\,\ne \,V\left( G \right)$. In this paper, it is proved that $G$ is a $\left( g,\,f,\,n \right)$-critical graph if

$$\text{bind}\left( G \right)\,>\,\frac{\left( a\,+\,b\,-\,1 \right)\left( p\,-\,1 \right)}{\left( a\,+\,1 \right)p\,-\,\left( a\,+b \right)\,-\,bn\,+\,2}\,\text{and}\,\text{p}\ge \,\frac{\left( a\,+\,b\,-\,1 \right)\left( a\,+\,b\,-2 \right)}{a\,+\,1}\,+\,\frac{bn}{a}.$$

Furthermore, it is shown that this result is best possible in some sense.