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 x of G, ...
In this paper, we define labeled multigraphs with ports, a graph model which specifies connection points for nodes and allows multiple edges and loops. The dynamic evolution of th...
In edge colouring it is often useful to have information about the degree distribution of the neighbours of a given vertex. For example, the well known Vizing's Adjacency Lem...
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive edges differ in colour. Let G be a 2-edge-coloured complete graph and let M b...
A k-frugal colouring of a graph G is a proper colouring of the vertices of G such that no colour appears more than k times in the neighbourhood of a vertex. This type of colouring...