2 papers
math.CO2021
On critical graphs for the chromatic edge-stability number
Hui Lei, Xiaopan Lian, Xianhao Meng +2
The {\em chromatic edge-stability number} of a graph is the minimum number of edges whose removal results in a spanning subgraph with the chromatic number smaller tha…
math.CO2012
A new upper bound on the acyclic chromatic indices of planar graphs
Weifan Wang, Qiaojun Shu, Yiqiao Wang
An acyclic edge coloring of a graph is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index of is the smallest integer $…