On M_f-edge colorings of graphs
From MaRDI portal
Publication:2158189
The authors define a new edge (not necessarily proper) coloring of the edges of a graph \(G\), where the only requirement is that for each vertex \(v\) of \(G\) is a prescribed maximum number \(f(v)\) of colors to be used on the edges incident to the vertex \(v\). Such an edge coloring is called an \(M_f\)-edge coloring of \(G\). Then \(\kappa_f(G)\) is defined to be the maximum number of colors used in an \(M_f\)-edge coloring of \(G\). Bounds and exact values for \(\kappa_f(G)\) are presented for various classes of graphs \(G.\)
Recommendations
Cites work
- \(\mathrm{M}_2\)-edge colorings of cacti and graph joins
- \(\mathrm{M}_2\)-edge colorings of dense graphs
- M₂-edge coloring and maximum matching of graphs
- M_i-edge colorings of graphs
- A note on M2-edge colorings of graphs
- Approximation algorithm for maximum edge coloring
- Approximation and hardness results for the maximum edge q-coloring problem
- Edge-colorings with no large polychromatic stars
- On \(N_2\)-vertex coloring of graphs
- On totally multicolored stars
- Rainbow generalizations of Ramsey theory: A survey
- The min-max edge \(q\)-coloring problem
Cited in
(7)- M₂-edge coloring and maximum matching of graphs
- \(\mathrm{M}_2\)-edge colorings of dense graphs
- A note on M2-edge colorings of graphs
- On the f-coloring of multigraphs
- Edge-Coloring and f-Coloring for Various Classes of Graphs
- On the μ-colorings of a matroid
- scientific article; zbMATH DE number 5226568 (Why is no real title available?)
This page was built for publication: On \(\mathrm{M}_f\)-edge colorings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2158189)