Plane Graphs with Parity Constraints
Let S be a set of n points in general position in the plane. Together with S we are given a set of parity constraints, that is, every point of S is labeled either even or odd. A graph G on S satisfies the parity constraint of a point p ∈ S, if the parity of the degree of p in G matches its label. In this paper we study how well various classes of planar graphs can satisfy arbitrary parity constraints. Specifically, we show that we can always find a plane tree, a two-connected outerplanar graph, or a pointed pseudo-triangulation which satisfy all but at most three parity constraints. With triangulations we can satisfy about 2/3 of all parity constraints. In contrast, for a given simple polygon H with polygonal holes on S, we show that it is NP-complete to decide whether there exists a triangulation of H that satisfies all parity constraints.
KeywordsParity Constraint Planar Graph Hamiltonian Cycle Degree Sequence Simple Polygon
Unable to display preview. Download preview PDF.
- 1.Aichholzer, O., Hackl, T., Huemer, C., Hurtado, F., Vogtenhuber, B.: Large bichromatic point sets admit empty monochromatic 4-gons (submitted) (2008)Google Scholar
- 2.Aichholzer, O., Krasser, H.: The point set order type data base: A collection of applications and results. In: Proc. 13th Canadian Conference on Computational Geometry, Waterloo, Ontario, Canada, pp. 17–20 (2001)Google Scholar
- 10.Pilz, A.: Parity properties of geometric graphs. Master’s thesis, Graz University of Technology, Austria (in preparation, 2009)Google Scholar