Parity-constrained triangulations with Steiner points

DOI10.1007/s00373-013-1389-6zbMath1306.05035OpenAlexW2064011321MaRDI QIDQ489340

Victor Alvarez

Publication date: 20 January 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1389-6

zbMATH Keywords

triangulationsgeometric graphsSteiner pointsalgorithmic combinatorial geometryparity-constrained

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (2)

Plane augmentation of plane graphs to meet parity constraints ⋮ Euler Transformation of Polyhedral Complexes

Cites Work

• Unnamed Item
• Unnamed Item
• Gedanken zur Vier-Farben-Vermutung
• A short proof of Chvatal's Watchman Theorem
• Triangulating with high connectivity.
• Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons
• Plane Graphs with Parity Constraints

This page was built for publication: Parity-constrained triangulations with Steiner points