443 search results - page 1 / 89 » Testing Hypergraph Coloring |
ICALP
2001
Springer
13 years 12 months ago
2001
Springer
In this paper we initiate the study of testing properties of hypergraphs. The goal of property testing is to distinguish between the case whether a given object has a certain prope...
ARSCOM
2006
13 years 7 months ago
2006
In this paper we define the concept of clique number of uniform hypergraph and study its relationship with circular chromatic number and clique number. For every positive integer ...
FOCS
2002
IEEE
14 years 12 days 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...
ARSCOM
2004
13 years 7 months ago
2004
The concept of circular chromatic number of graphs was introduced by Vince(1988). In this paper we define circular chromatic number of uniform hypergraphs and study their basic pr...
WAOA
2004
Springer
14 years 23 days ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...