@Article{Ivančo2016,
author = "Ivančo, Jaroslav",
title = "M<sub>2</sub>-edge colorings of dense graphs",
journal = "Opuscula Math.",
year = "2016",
volume = "36",
number = "5",
pages = "603--612",
doi = "http://dx.doi.org/10.7494/OpMath.2016.36.5.603",
url = "http://dx.doi.org/10.7494/OpMath.2016.36.5.603",
abstract = "An edge coloring \(\varphi\) of a graph \(G\) is called an \(\mathrm{M}_i\)-edge coloring if \(|\varphi(v)|\leq i\) for every vertex \(v\) of \(G\), where \(\varphi(v)\) is the set of colors of edges incident with \(v\). Let \(\mathcal{K}_i(G)\) denote the maximum number of colors used in an \(\mathrm{M}_i\)-edge coloring of \(G\). In this paper we establish some bounds of \(\mathcal{K}_2(G)\), present some graphs achieving the bounds and determine exact values of \(\mathcal{K}_2(G)\) for dense graphs.",
keywords = "edge coloring, dominating set, dense graphs",
issn = "1232-9274"
}