28 search results - page 1 / 6 » Neighbour-Distinguishing Edge Colourings of Random Regular G... |
COMBINATORICS
2006
13 years 4 months ago
2006
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...
Book
A well-written book about graph theory.
CPC
2008
13 years 4 months ago
2008
In 1998 Luczak, R
SPAA
2005
ACM
13 years 9 months ago
2005
ACM
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
CPC
2000
13 years 4 months ago
2000