Parity-constrained triangulations with Steiner points

DOI10.1007/S00373-013-1389-6zbMATH Open1306.05035OpenAlexW2064011321MaRDI QIDQ489340FDOQ489340

Authors: 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

Recommendations

• Plane graphs with parity constraints
• Plane Graphs with Parity Constraints
• Colored quadrangulations with Steiner points
• Bichromatic quadrangulations with Steiner points
• scientific article; zbMATH DE number 1796958

zbMATH Keywords

triangulationsSteiner pointsgeometric graphsalgorithmic combinatorial geometryparity-constrained

Mathematics Subject Classification ID

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

Cites Work

• A short proof of Chvatal's Watchman Theorem
• Title not available (Why is that?)
• Large bichromatic point sets admit empty monochromatic 4-gons
• Plane Graphs with Parity Constraints
• Title not available (Why is that?)
• Gedanken zur Vier-Farben-Vermutung
• Triangulating with high connectivity.

Cited In (9)

• Plane graphs with parity constraints
• Quality Triangulations with Locally Optimal Steiner Points
• ISOMORPHIC TRIANGULATIONS WITH SMALL NUMBER OF STEINER POINTS
• Euler transformation of polyhedral complexes
• Regular triangulations and Steiner points
• Plane augmentation of plane graphs to meet parity constraints
• Title not available (Why is that?)
• OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS
• Plane Graphs with Parity Constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489340)