Sciweavers

28 search results - page 1 / 6
» Neighbour-Distinguishing Edge Colourings of Random Regular G...
Sort
View
87
Voted
COMBINATORICS
2006
116views more  COMBINATORICS 2006»
14 years 9 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
231
Voted

Book
1174views
16 years 7 months ago
Graph Theory
A well-written book about graph theory.
Reinhard Diestel
72
Voted
CPC
2008
114views more  CPC 2008»
14 years 9 months ago
Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
In 1998 Luczak, R
Peter Allen
SPAA
2005
ACM
15 years 3 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
62
Voted
CPC
2000
89views more  CPC 2000»
14 years 9 months ago
Optimal Construction Of Edge-Disjoint Paths In Random Regular Graphs
Alan M. Frieze, Lei Zhao