An edge colouring of multigraphs
We consider a strict k-colouring of a multigraph G as a surjection f from the vertex set of G into a set of colours {1,2,…,k} such that, for every non-pendant vertex χ of G, there exist at least two edges incident to χ and coloured by the same colour. The maximum number of colours in a strict edge c...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2007-07-01
|
| Series: | Computer Science Journal of Moldova |
| Online Access: | http://www.math.md/files/csjm/v15-n2/v15-n2-(pp212-216).pdf |