Sciweavers

131 search results - page 3 / 27
» Colouring Random Regular Graphs
Sort
View
DM
2008
116views more  DM 2008»
13 years 5 months ago
Total and fractional total colourings of circulant graphs
In this paper, the total chromatic number and fractional total chromatic number of circulant graphs are studied. For cubic circulant graphs we give upper bounds on the fractional ...
Riadh Khennoufa, Olivier Togni
DMTCS
2006
66views Mathematics» more  DMTCS 2006»
13 years 5 months ago
On randomly colouring locally sparse graphs
We consider the problem of generating a random q-colouring of a graph G = (V, E). We consider the simple Glauber Dynamics chain. We show that if for all v V the average degree of...
Alan M. Frieze, Juan Vera
DMTCS
2002
100views Mathematics» more  DMTCS 2002»
13 years 4 months ago
Upper bounds on the non-3-colourability threshold of random graphs
Nikolaos Fountoulakis, Colin McDiarmid
LATIN
2000
Springer
13 years 8 months ago
Small Maximal Matchings in Random Graphs
We look at the minimal size of a maximal matching in general, bipartite and
Michele Zito