Star edge coloring of 2-connected outer plane graphs with maximum degree 3
Kai Deng · Journal of Northeast Normal University · 2011
A proper edge coloring of graph G is called star edge coloring if there is no path with length 4 in G.The minimum number of colors required for any star edge coloring is called the star chromatic index of G and denoted by χ′ s(G).Let G be a 2-connected outer plane graph with maximum degree 3,the conclusion 4≤χ′ s(G)≤6 is proved,and the star chromatic index of some special outer plane graphs is obtained.