Plane Graphs with Parity Constraints
From MaRDI portal
Recommendations
Cites work
- Degree constrained tree embedding into points in the plane
- scientific article; zbMATH DE number 3169205 (Why is no real title available?)
- Large bichromatic point sets admit empty monochromatic 4-gons
- Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
- On embedding an outer-planar graph in a point set
- One strike against the min-max degree triangulation problem
- Optimal Algorithms to Embed Trees in a Point Set
- Planar Formulae and Their Uses
- Tight degree bounds for pseudo-triangulations of points
Cited in
(9)- On almost empty monochromatic triangles and convex quadrilaterals in colored point sets
- Plane graphs with parity constraints
- Plane augmentation of plane graphs to meet parity constraints
- Almost empty monochromatic triangles in planar point sets
- On Planar Quasi-Parity Graphs
- Parity-constrained triangulations with Steiner points
- Euler transformation of polyhedral complexes
- Recognizing planar strict quasi-parity graphs
- Parity vertex colouring of plane graphs
This page was built for publication: Plane Graphs with Parity Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183437)