25 search results - page 2 / 5 » Colouring Random 4-Regular Graphs |
DM
2008
13 years 7 months ago
2008
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 ...
DM
2008
13 years 7 months ago
2008
For any graph G, the k-improper chromatic number k (G) is the smallest number of colours used in a colouring of G such that each colour class induces a subgraph of maximum degree ...
APPROX
1998
Springer
13 years 12 months ago
1998
Springer
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
FCT
2009
Springer
14 years 2 months ago
2009
Springer
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
DMTCS
2006
13 years 7 months ago
2006
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...