Flower snark图的强边染色

详细信息    查看全文 | 推荐本文 |

英文篇名：Strong Edge Coloring of Flower Snark 作者：董晓媛 英文作者：DONG Xiao-yuan;Nantong Normal College; 关键词：强边染色 ; Flower ; snark图 ; 强边色数 英文关键词：strong edge coloring;;Flower snark;;strong edge coloring chromatic number 中文刊名：CCSS 英文刊名：Journal of Changchun Normal University 机构：南通师范高等专科学校数理系; 出版日期：2019-02-20 出版单位：长春师范大学学报 年：2019 期：v.38;No.351 基金：国家自然科学基金项目“广义柯克曼方和t-设计的构造及其应用研究”(11371207);; 江苏省高校自然科学面上项目“两个图的积的交叉数与页交叉数”(18KJD110009);; 南通师范高等专科学校重点资助课题“两个图的直积和曲面网格图的L(2,1)-标号”(TSGZ201806) 语种：中文; 页：CCSS201902002 页数：5 CN：02 ISSN：22-1409/G4 分类号：9-13

摘要

图G的强边染色是在对图G的边进行正常染色的基础上,使得长为3的路上的任意两条边染不同的颜色。对图G进行强边着色所需的最小颜色数,称为图G的强边色数,记为χ's(G)。本文研究了Flower snark及其相关图的强边染色,并得到Flower图的强边色数χ's(F_n)=6(n≥5)。
        A proper edge coloring of graph G is called strong edge coloring if any two edges on a path of length three receive distinct colors. And the required minimum number of colors is called the strong chromaic index,note as χ'_s( G). In this paper,while n≥5,we get the strong chromaic index of Flower snark is χ'_s( F_n) = 6.

引文

[1]J L Fouquet,J L Jolivet. Strong edge-coloring of graphs and applications to multi-k-gons[J]. Ars Combin,1983,16(A):141-150.
    [2]J L Fouquet,J L Jolivet. Strong edge-coloring of cubic planar graphs[J]. Graph Theory,1984(8):247-264.
    [3]P Erd9s. Problems and results in combinatorial analysis and graph theory[J]. Discrete Math,1988(72):81-92.
    [4]Andersen L D. The strong chromatic index of a cubic graph is at most 10[J]. Discrete Mathematics,1992(108):231-252.
    [5]张忠辅,李敬文,陈祥恩,等.图的距离不大于β的任意两点可区别的边染色[J].数学学报:中文版,2006(3):703-708.
    [6]Cranston D. Strong edge-coloring graphs with maximum degree 4 using 22 colors[J]. Discrete Mathematics,2006(306):2772-2778.
    [7]R J Faudree,R H Schelp. The strong chromatic index of graphs[J]. Ars Combin,1990(29):205-211.
    [8]W C Shiu,P C B Lam,W K Tam. On strong chromatic index of Halin graph[J]. J Combin Math Comp,2006(57):211-222.
    [9]W C Shiu,W K Tam. The strong chromatic index of complete cubic Halin graphs[J]. Applied Math Letters,2009(22):754-758.