Sciweavers

Share
28 search results - page 1 / 6
» Neighbour-Distinguishing Edge Colourings of Random Regular G...
Sort
View
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

Book
1174views
13 years 9 months ago
Graph Theory
A well-written book about graph theory.
Reinhard Diestel
SPAA
2005
ACM
12 years 5 months ago
Peer-to-peer networks based on random transformations of connected regular undirected graphs
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...
Peter Mahlmann, Christian Schindelhauer
books