Maximal edge colorings of graphs
From MaRDI portal
Publication:6181990
Abstract: For a graph of order a maximal edge coloring is a proper edge coloring with colors such that adding any edge to 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 6473829 (Why is no real title available?)
- scientific article; zbMATH DE number 426166 (Why is no real title available?)
- scientific article; zbMATH DE number 3468893 (Why is no real title available?)
- scientific article; zbMATH DE number 637270 (Why is no real title available?)
- Maximal designs and configurations -- a survey
- Maximal edge-colorings of graphs
- Maximal partial Latin cubes
- Maximal sets of 2-factors and Hamiltonian cycles
- On-line edge-coloring with a fixed number of colors
- The greedy algorithm is optimal for on-line edge coloring
- The spectrum of maximal sets of one-factors
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)