%A BabiĆski, Sebastian
%A Grzesik, Andrzej
%D 2019
%T Maximal edge-colorings of graphs
%K
%X For graph G of order n a maximal edge - coloring is a proper partial coloring with fixed number of colors (equal to n or n-1) such that adding any edge to G in any color makes it improper . Meszka and Tyniec proved that for some numbers of edges it is impossible to find such a graph, and provided constructions for some other numbers of edges . However , for many values , the problem remained open. We give a complete solution of this problem for all even values of n and for odd n not smaller than 37 .
%U http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1287
%J Acta Mathematica Universitatis Comenianae
%0 Journal Article
%P 403-407%V 88
%N 3
%@ 0862-9544
%8 2019-07-26