38 search results - page 4 / 8 » Coloring H-free hypergraphs |
COMBINATORICS
2002
13 years 8 months ago
2002
Erdos, Rubin, and Taylor found a nice correspondence between the minimum order of a complete bipartite graph that is not r-choosable and the minimum number of edges in an r-unifor...
DAM
2008
13 years 8 months ago
2008
We consider vertex coloring of an acyclic digraph G in such a way that two vertices which have a common ancestor in G receive distinct colors. Such colorings arise in a natural wa...
ICALP
2007
Springer
14 years 14 days ago
2007
Springer
We provide a framework for online conflict-free coloring (CF-coloring) of any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring ...
FOCS
2000
IEEE
14 years 1 months ago
2000
IEEE
FOCS
1998
IEEE
14 years 26 days ago
1998
IEEE