Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs

It is shown that if a planar straight line graph (PSLG) with n vertices in general position in the plane can be augmented to a 3-edge-connected PSLG, then 2n−2 new edges are enough for the augmentation. This bound is tight: there are PSLGs with n ≥ 4 vertices such that any augmentation to a 3-edge-connected PSLG requires 2n − 2 new edges.

• Type: Conference
• Year: 2009
• Where: ISAAC
• Authors: Marwan Al-Jubeh, Mashhood Ishaque, Kristóf Rédei, Diane L. Souvaine, Csaba D. Tóth
• Keywords: Algorithms, ISAAC 2009, Planar Straight Line