131 search results - page 8 / 27 » Colouring Random Regular Graphs |
118
click to vote
APPROX
2004
Springer
15 years 6 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...
120
click to vote
ACSC
2005
IEEE
15 years 6 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
2000
15 years 29 days ago
2000
CPC
2002
15 years 29 days ago
2002