Star edge coloring of maximal outer plane graphs
Tian Shuang-liang · 2011
A proper edge coloring of graph G is called star edge coloring if there is no path of length 4 or 4-cycle in G which is bicolored.The minimum number of colors required for a star edge coloring is called the star chromatic index of G and denoted by x_s′(G).In this paper,it is proved that the star chromatic indices of maximal outer plane graphs with maximum degree 4 are 6,and 6≤x′_s(G_n)≤n-1 for every maximal outer plane graph G_n with order n at least 8,and the lower and upper bounds are both attainable.