The chromatic edge-stability number ${\rm es}_χ(G)$ of a graph $G$ is the minimum number of edges whose removal results in a spanning subgraph $G'$ with $χ(G')=χ(G)-1$. Edge-stability critical graphs are introduced as the graphs $G$ with the property that ${\rm es}_χ(G-e) < {\rm es}_χ(G)$ holds for every edge $e\in E(G)$. If $G$ is an edge-stability critical graph with $χ(G)=k$ and ${\rm es}_χ(G)=\ell$, then $G$ is $(k,\ell)$-critical. Graphs which are $(3,2)$-critical and contain at most four odd cycles are classified. It is also proved that the problem of deciding whether a graph $G$ has $χ(G)=k$ and is critical for the chromatic number can be reduced in polynomial time to the problem of deciding whether a graph is $(k,2)$-critical.