A Note on the Strong Edge-coloring of Outerplanar Graphs with Maximum Degree 3  

作　　者：Shun-yi LIU He-ping ZHANG Hong-liang LU Yu-qing LIN 

机构地区：[1]School of Mathematics and Statistics,Lanzhou University [2]College of Science,Chang’an University [3]School of Mathematics and Statistics,Xi’an Jiaotong University [4]School of Electrical Engineering and Computer Science,The University of Newcastle

出　　处：《Acta Mathematicae Applicatae Sinica》2016年第4期883-890,共8页应用数学学报（英文版）

基　　金：Supported by the National Natural Science Foundation of China under Grant No.11501050;the Fundamental Research Funds for the Central Universities under Grant No.310812151003

摘　　要：A strong k-edge-coloring of a graph G is an assignment of k colors to the edges of G in such a way that any two edges meeting at a common vertex, or being adjacent to the same edge of G, axe assigned different colors. The strong chromatic index of G is the smallest integer k for which G has a strong k-edge-coloring. In this paper, we have shown that the strong chromatic index is no larger than 6 for outerplanax graphs with maximum degree 3.A strong k-edge-coloring of a graph G is an assignment of k colors to the edges of G in such a way that any two edges meeting at a common vertex, or being adjacent to the same edge of G, axe assigned different colors. The strong chromatic index of G is the smallest integer k for which G has a strong k-edge-coloring. In this paper, we have shown that the strong chromatic index is no larger than 6 for outerplanax graphs with maximum degree 3.

关 键 词：strong edge-coloring strong chromatic index outerplanar graphs 

分 类 号：O157.5[理学—数学] TS933.21[理学—基础数学]