Maximal edge colorings of graphs

From MaRDI portal
Publication:6181990




Abstract: For a graph G of order n a maximal edge coloring is a proper edge coloring with chi(Kn) colors such that adding any edge to G in any color makes it improper. Meszka and Tyniec proved that for some values of the number of edges there are no graphs with a maximal edge coloring, while for some other values, they provided constructions of such graphs. However, for many values of the number of edges determining whether there exists any graph with a maximal edge coloring remained open. We give a complete solution of this problem.









This page was built for publication: Maximal edge colorings of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6181990)