18 search results - page 2 / 4 » Injective colorings of sparse graphs |
STOC
2002
ACM
15 years 12 months ago
2002
ACM
We analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove that almost all graphs with average degree dp4:03; i.e., G?n; p ? d=n?; are 3-colorable a...
106
click to vote
MST
2010
14 years 10 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
DM
2010
14 years 11 months ago
2010
COMBINATORICS
2002
14 years 11 months ago
2002
SIAMDM
2010
14 years 10 months ago
2010
For a graph G = (V, E) we consider vertex-k-labellings f : V → {1, 2, . . . , k} for which the induced edge weighting w : E → {2, 3, . . . , 2k} with w(uv) = f(u) + f(v) is inj...