M_{2}-edge colorings of dense graphs
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 \(\math...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AGH Univeristy of Science and Technology Press
2016-01-01
|
| Series: | Opuscula Mathematica |
| Subjects: | |
| Online Access: | http://www.opuscula.agh.edu.pl/vol36/5/art/opuscula_math_3636.pdf |