Δ ≥ 4，g ≥ 6的符号图的边染色
Edge Coloring of Signed Graphs with Δ ≥ 4 and g ≥ 6
DOI: 10.12677/aam.2025.144153, PDF,   
作者: 黄 婧：浙江师范大学数学科学学院，浙江 金华
关键词: 符号图；边染色；最大度；围长；Signed Graph； Edge Coloring； Maximum Degree； Girth
摘要: 2020年，Behr及Zhang等人将边染色的概念推广到符号图上。令符号图(G, σ)可嵌入非负欧拉特征值的表面，本文通过分析极小反例的结构性质，证明了Δ ≥ 4，g ≥ 6的符号图(G, σ)边色数为Δ。
Abstract: 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 Δ.
文章引用：黄婧. Δ ≥ 4，g ≥ 6的符号图的边染色[J]. 应用数学进展, 2025, 14(4): 200-204. https://doi.org/10.12677/aam.2025.144153

参考文献

[1] Behr, R. (2020) Edge Coloring Signed Graphs. Discrete Mathematics, 343, Article ID: 111654. [Google Scholar] [CrossRef] 
[2] Zhang, L., Lu, Y., Luo, R., Ye, D. and Zhang, S. (2020) Edge Coloring of Signed Graphs. Discrete Applied Mathematics, 282, 234-242. [Google Scholar] [CrossRef] 
[3] Li, X. and Luo, R. (2003) Edge Coloring of Embedded Graphs with Large Girth. Graphs and Combinatorics, 19, 393-401. [Google Scholar] [CrossRef] 
[4] Vizing, V. (1964) On an Estimate of the Chromatic Class of a p-Graph. Diskretny Analiz, 3, 23-30.
[5] Cao, Y., Luo, R., Miao, Z. and Zhao, Y. (2023) Vizing’s Adjacency Lemma on Edge Chromatic Critical Signed Graphs and Its Applications. Discrete Applied Mathematics, 329, 96-105. [Google Scholar] [CrossRef] 
[6] Lebesgue, H. (1940) Quelques conséquences simples de la formule d’Euler. Journal of Mathematics, 9, 27-43.
[7] Ore, O. (1967) The Four-Color Problem. Academic Press.

为你推荐