Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
COMBINATORICS
2006
116views more  COMBINATORICS 2006»
11 years 11 months ago
Neighbour-Distinguishing Edge Colourings of Random Regular Graphs
A proper edge colouring of a graph is neighbour-distinguishing if for all pairs of adjacent vertices v, w the set of colours appearing on the edges incident with v is not equal to...
Catherine S. Greenhill, Andrzej Rucinski
DM
2010
115views more  DM 2010»
11 years 12 months ago
Edge colouring by total labellings
We introduce the concept of an edge-colouring total k-labelling. This is a labelling of the vertices and the edges of a graph G with labels 1, 2, . . . , k such that the weights o...
Stephan Brandt, Kristína Budajová, D...
AAIM
2007
Springer
151views Algorithms» more  AAIM 2007»
12 years 6 months ago
Acyclic Edge Colouring of Outerplanar Graphs
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
Rahul Muthu, N. Narayanan, C. R. Subramanian
books