570 search results - page 17 / 114 » Edge Coloring with Delays |
157
click to vote
ISTCS
1993
Springer
15 years 10 months ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...
147
click to vote
TCS
2008
15 years 5 months ago
2008
Given a graph G and an integer k, two players alternatively color the edges of G using k colors so that adjacent edges get different colors. The game chromatic index g(G) is the m...
169
click to vote
FOCS
2002
IEEE
15 years 11 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...
159
click to vote
APPROX
2009
Springer
16 years 17 days ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
153
click to vote
ICALP
2000
Springer
15 years 9 months ago
2000
Springer
: A 2-coloring of a hypergraph is a mapping from its vertex set to a set of two colors such that no edge is monochromatic. Let H = H k n p be a random k-uniform hypergraph on a ver...