2310 search results - page 112 / 462 » Coloring Random Graphs |
114
Voted
WEA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
154
Voted
COMBINATORICA
2010
14 years 11 months ago
2010
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
COMBINATORICS
2006
15 years 2 months ago
2006
An H-factor of a graph G is a spanning subgraph of G whose connected components are isomorphic to H. Given a properly edge-colored graph G, a rainbow H-subgraph of G is an H-subgr...
124
click to vote
COMBINATORICS
2006
15 years 2 months ago
2006
A proper edge colouring of a graph is neighbour-distinguishing if for all pairs of adjacent vertices v, w the set of colours appearing on the edges incident with v is not equal to...
118
click to vote
RSA
2006
15 years 2 months ago
2006
Motivated by a problem that arises in the study of mirrored storage systems, we describe, for any fixed , > 0 and any integer d 2, explicit or randomized constructions of d-r...