On the upper chromatic index of a multigraph
We consider the colorings of the edges of a multigraph in such a way that every non-pendant vertex is incident to at least two edges of the same color. The maximum number of colors that can be used in such colorings is the upper chromatic index of a multigraph G, denoted by not(χ')(G). We prove...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2002-01-01
|
| Series: | Computer Science Journal of Moldova |
| Online Access: | http://www.math.md/nrofdownloads.php?file=/files/csjm/v10-n1/v10-n1-(pp81-91).pdf |