2 search results - page 1 / 1 » Coloring geometric hypergraph defined by an arrangement of h... |
CCCG
2010
13 years 8 months ago
2010
We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by ha...
SIAMDM
2010
13 years 1 months ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...