| 摘要: |
| 本文研究了图的2-强边色数的上界. 利用图染色的概率方法中的一般局部引理, 得到了3 ≤Δ ≤ 730时,χ's(G,2) ≤ 2Δ + 1, 推广了参考文献[11,12]中的结果 |
| 关键词: 2-强边染色 2-强边色数 一般局部引理. |
| DOI： |
| 分类号:O157.5 |
| 基金项目:Supported by National Natural Science Foundation of China (11071169) |
|
| UPPER BOUND ON 2-STRONG EDGE CHROMATIC NUMBERS OF GRAPHS |
|
TIAN Jing-jing1, NIE Yu-feng1, WANG Li-gong1, CHANG Jian2
|
|
1.Department of Applied Mathematics, Northwestern Polytechnical University, Xi'an 710129, China;2.Institute of Mathematics Science, Inner Mongolia Normal University, Huhhot 010022, China
|
| Abstract: |
| In this paper, we study the upper bound for the the r-strong edge chromatic num-ber of regular graph. By probability method, we prove that if 3 ≤ Δ ≤ 730, then χ's(G,2) ≤ 2Δ+1 by the general local lemma, which extends some corresponding results in [11,12]. |
| Key words: 2-strong edge coloring 2-strong edge chromatic number the general local lemma |
