2079 search results - page 24 / 416 » Universality of random graphs |
116
click to vote
DM
2008
15 years 2 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 ...
113
click to vote
DM
2007
15 years 1 months ago
2007
The main aim of this short paper is to answer the following question. Given a fixed graph H, for which values of the degree d does a random d-regular graph on n vertices contain ...
125
click to vote
COMBINATORICS
2002
15 years 1 months ago
2002
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...
TCC
2005
Springer
15 years 7 months ago
2005
Springer
FOCS
2000
IEEE
15 years 6 months ago
2000
IEEE