Part of the Lecture Notes in Computer Science book series (LNCS, volume 9411)
Augmenting Planar Straight Line Graphs to 2-Edge-Connectivity
We show that every planar straight line graph (PSLG) with n vertices can be augmented to a 2-edge-connected PSLG with the addition of at most \(\lfloor (4n-4)/3\rfloor \) new edges. This bound is the best possible.
© Springer International Publishing Switzerland 2015