Resumen de Augmenting the edge connectivity of planar straight line graphs to three

Csaba D. Tóth, Pavel Valtr

• We characterize the 2-connected and 2-edge connected planar straight line graphs, respectively, that have embedding preserving augmentations to 3-connected and 3-edge connected planar straight line graphs. If such an augmentation is possible, then it can be done using at most n − 2 new edges in the worst case. These bounds are best possible.