M i -Edge Colorings of Graphs
Július Czap · 2011
An edge coloring of a graph G is called Mi-edge coloring if at most i colors appear at any vertex of G. Let Ki(G) denote the maximum number of colors used in an Mi-edge coloring of G. In this paper we determine the exact value of K2(G) for any graph G of maximum degree at most 3. Mathematics Subject Classification: 05C15, 05C38