On critical graphs for the chromatic edge-stability number
Lei, Hui, Xiaopan Lian, Xianhao Meng, Yongtang Shi, Yiqiao Wang · arXiv (Cornell University) · 2021
The {\em chromatic edge-stability number} $es_χ(G)$ of a graph $G$ is the minimum number of edges whose removal results in a spanning subgraph with the chromatic number smaller than that of $G$. A graph $G$ is called {\em $(3,2)$-critical} if $χ(G)=3$, $es_χ(G)=2$ and for any edge $e\in E(G)$, $es_χ(G-e)