A vertex-face assignment for plane graphs

DOI10.1016/J.COMGEO.2008.06.005MaRDI QIDQ1025293zbMATH OpenOpenAlexFDO

Authors Diane L. Souvaine, Csaba D. Tóth

Publication date 18 June 2009

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2008.06.005

zbMATH Keywords

pseudo-triangulationencompassing graphplane straight line graph

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Connectivity augmentation in plane straight line graphs
• Augmenting the edge connectivity of planar straight line graphs to three
• Tri-edge-connectivity augmentation for planar straight line graphs
• Connectivity augmentation in planar straight line graphs
• Vertex-colored encompassing graphs

Cites work

• Acute triangulations of polygons
• Algorithm Theory - SWAT 2004
• Combinatorial pseudo-triangulations
• Every set of disjoint line segments admits a binary tree
• Planar minimally rigid graphs and pseudo-triangulations
• Pointed and colored binary encompassing trees
• Ray shooting in polygons using geodesic triangulations
• Tight degree bounds for pseudo-triangulations of points

Cited in

(4)

• Pointed binary encompassing trees: simple and optimal
• Vertex-colored encompassing graphs
• Augmenting the edge connectivity of planar straight line graphs to three
• More on the structure of plane graphs with prescribed degrees of vertices, faces, edges and dual edges

This page was built for publication: A vertex-face assignment for plane graphs

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