131 search results - page 8 / 27 » Colouring Random Regular Graphs |
APPROX
2004
Springer
14 years 1 months ago
2004
Springer
Given any integer d ≥ 3, let k be the smallest integer such that d < 2k log k. We prove that with high probability the chromatic number of a random d-regular graph is k, k + 1...
ACSC
2005
IEEE
14 years 1 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
CPC
2006
13 years 7 months ago
2006
CPC
2000
13 years 7 months ago
2000
CPC
2002
13 years 7 months ago
2002