Goldberg snark图的强边染色  

Strong edge coloring of Goldberg snark

作　　者：董晓媛[1] 马登举[2] DONG Xiao-yuan;MA Deng-ju(Department of Mathematics and Physics,Nantong Normal College,Nantong 226007,China;School of Sciences,Nantong University,Nantong 226000,China)

机构地区：[1]南通师范高等专科学校数理系,江苏南通226007 [2]南通大学理学院,江苏南通226000

出　　处：《东北师大学报（自然科学版）》2018年第4期16-19,共4页Journal of Northeast Normal University(Natural Science Edition)

基　　金：国家自然科学基金资助项目(11371207);江苏省高校自然科学基金资助项目(18KJD110009);南通师范高等专科学校重点资助课题(TSGZ201606)

摘　　要：研究了Goldberg snark图的强边染色问题,得到了Goldberg snark图的强边色数χ′s(Bk)=6.A strong edge coloring of a graph G is an assignment of colors to the edges of the graph such that any two edges at distance at most 2 receive distinct colors.In this paper,we get the strong edge coloring of Goldberg snark is six.

关 键 词：强边染色 Goldberg snark图 强边色数 

分 类 号：O157.5[理学—数学]