M_{2}-edge colorings of dense graphs
Jaroslav Ivančo · Opuscula Mathematica · 2016
An edge coloring ϕ of a graph G is called an Mi-edge coloring if |ϕ(v)| ≤ i for every vertex v of G, where ϕ(v) is the set of colors of edges incident with v. Let Ki(G) denote the maximum number of colors used in an Mi-edge coloring of G.In this paper we establish some bounds of K2(G), present some graphs achieving the bounds and determine exact values of K2(G) for dense graphs.