RO EN
An edge colouring of multigraphs
Authors: Mario Gionfriddo, Alberto Amato
– 0.13 Mb
Abstract
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.Mario Gionfriddo, Alberto Amato
Dipartimento di Matematica e Informatica
Universita di Catania
Viale Andrea Doria 6, 95125 Catania, Italia
E-mail:
Dipartimento di Matematica e Informatica
Universita di Catania
Viale Andrea Doria 6, 95125 Catania, Italia
E-mail:
Fulltext
– 0.13 Mb
Contents
- Filip the Catalyst
- We are proud to be side by side
- Functional FX-bar Projections of the (Romanian) Verbal Group and Sub-Groups on the Syntactic-Semantic Interface
- SONARES - A decision support system in ultrasound investigations
- Affordability and Paradigms in Agent-Based Systems
- An automatic image recognition approach
- An edge colouring of multigraphs
- Generalized Priority Models for QoS and CoS Network Technologies
- Balkan Olympiad in Informatics for school students
- Instructions for authors
