Edge Coloring of Signed Graphs with Δ ≥ 4 and <i>g</i> ≥ 6

2020年，Behr及Zhang等人将边染色的概念推广到符号图上。令符号图(G, σ)可嵌入非负欧拉特征值的表面，本文通过分析极小反例的结构性质，证明了Δ ≥ 4，g ≥ 6的符号图(G, σ)边色数为Δ。In 2020, Behr and Zhang et al. extended the concept of edge coloring to signed graphs. Let the signed graph (G, σ) be embeddable in a surface with non-negative Euler characteristic. By analyzing the structural properties of the minimal counterexample, this paper proves that the edge chromatic number of the signed graph (G, σ) with Δ ≥ 4 and g ≥ 6 is Δ.