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 |
| _version_ | 1798024566818209792 |
|---|---|
| author | Mario Gionfriddo, Alberto Amato |
| author_facet | Mario Gionfriddo, Alberto Amato |
| author_sort | Mario Gionfriddo, Alberto Amato |
| collection | DOAJ |
| description | 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 colouring of G is called the upper chromatic index of G and is denoted by χ(G). In this paper we prove some results about it. |
| first_indexed | 2024-04-11T18:05:48Z |
| format | Article |
| id | doaj.art-e0bdbf4e69b04ffd883913f5af9cd1ec |
| institution | Directory Open Access Journal |
| issn | 1561-4042 |
| language | English |
| last_indexed | 2024-04-11T18:05:48Z |
| publishDate | 2007-07-01 |
| publisher | Vladimir Andrunachievici Institute of Mathematics and Computer Science |
| record_format | Article |
| series | Computer Science Journal of Moldova |
| spelling | doaj.art-e0bdbf4e69b04ffd883913f5af9cd1ec2022-12-22T04:10:21ZengVladimir Andrunachievici Institute of Mathematics and Computer ScienceComputer Science Journal of Moldova1561-40422007-07-01152(44)212216An edge colouring of multigraphsMario Gionfriddo, Alberto Amato0Dipartimento di Matematica e Informatica Universita di Catania Viale Andrea Doria 6, 95125 Catania, ItaliaWe 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 colouring of G is called the upper chromatic index of G and is denoted by χ(G). In this paper we prove some results about it.http://www.math.md/files/csjm/v15-n2/v15-n2-(pp212-216).pdf |
| spellingShingle | Mario Gionfriddo, Alberto Amato An edge colouring of multigraphs Computer Science Journal of Moldova |
| title | An edge colouring of multigraphs |
| title_full | An edge colouring of multigraphs |
| title_fullStr | An edge colouring of multigraphs |
| title_full_unstemmed | An edge colouring of multigraphs |
| title_short | An edge colouring of multigraphs |
| title_sort | edge colouring of multigraphs |
| url | http://www.math.md/files/csjm/v15-n2/v15-n2-(pp212-216).pdf |
| work_keys_str_mv | AT mariogionfriddoalbertoamato anedgecolouringofmultigraphs AT mariogionfriddoalbertoamato edgecolouringofmultigraphs |