762 search results - page 4 / 153 » Strategic Coloring of a Graph |
102
click to vote
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5 ) colors. Our...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
A graph G is (a, b)-choosable if for any color list of size a associated with each vertices, one can choose a subset of b colors such that adjacent vertices are colored with disjoi...
SIROCCO
2007
15 years 28 days ago
2007
We present the first location oblivious distributed unit disk graph coloring algorithm having a provable performance ratio of three (i.e. the number of colors used by the algorit...
COLING
1990
15 years 21 days ago
1990
ALGORITHMICA
2008
14 years 11 months ago
2008
We show efficient algorithms for edge-coloring planar graphs. Our main result is a linear-time algorithm for coloring planar graphs with maximum degree with max{, 9} colors. Thus...