Plane Graphs with Parity Constraints

DOI10.1007/978-3-642-03367-4_2zbMath1253.68325OpenAlexW1890590972WikidataQ59782340 ScholiaQ59782340MaRDI QIDQ3183437

No author found.

Publication date: 20 October 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/plane-graphs-with-parity-constraints(6eb6f5c0-6642-4551-b8ac-31322045e220).html

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

Almost empty monochromatic triangles in planar point sets ⋮ Plane graphs with parity constraints ⋮ Parity-constrained triangulations with Steiner points ⋮ On almost empty monochromatic triangles and convex quadrilaterals in colored point sets ⋮ Euler Transformation of Polyhedral Complexes

Cites Work

• Unnamed Item
• One strike against the min-max degree triangulation problem
• Degree constrained tree embedding into points in the plane
• On embedding an outer-planar graph in a point set
• Tight degree bounds for pseudo-triangulations of points
• Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons
• Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
• Planar Formulae and Their Uses
• Optimal Algorithms to Embed Trees in a Point Set

This page was built for publication: Plane Graphs with Parity Constraints