37 search results - page 2 / 8 » The Hardness of 3 - Uniform Hypergraph Coloring |
PODS
2007
ACM
14 years 5 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
ESA
2006
Springer
13 years 8 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
LATIN
2010
Springer
13 years 3 months ago
2010
Springer
Abstract In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if th...
COCOA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
DM
1998
13 years 4 months ago
1998
We investigate the following question: “Given an intersecting multi-hypergraph on n points, what fraction of edges must be covered by any of the best 2 points?” (Here “best...