157 search results - page 4 / 32 » Online coloring of hypergraphs |
77
Voted
FSTTCS
2010
Springer
14 years 8 months ago
2010
Springer
We describe a fixed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism which has running time 2O(b) NO(1) , where the parameter b is the maximum size of the col...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Let H = (V, E) be a hypergraph. A conflict-free coloring of H is an assignment of colors to V such that in each hyperedge e E there is at least one uniquely-colored vertex. This ...
123
Voted
COMBINATORICS
2002
14 years 10 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...
52
Voted
DAM
2008
14 years 10 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...
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE