Sciweavers

Share
131 search results - page 1 / 27
» Colouring Random Regular Graphs
Sort
View
COMBINATORICS
2006
116views more  COMBINATORICS 2006»
10 years 1 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
CPC
2007
101views more  CPC 2007»
10 years 1 months ago
Colouring Random 4-Regular Graphs
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an eļ¬ƒcient algorithm which a.a.s. 3colours a random 4-regular ...
Lingsheng Shi, Nicholas C. Wormald
CPC
2007
95views more  CPC 2007»
10 years 1 months ago
Colouring Random Regular Graphs
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular...
Lingsheng Shi, Nicholas C. Wormald

Book
1174views
11 years 11 months ago
Graph Theory
A well-written book about graph theory.
Reinhard Diestel
books