… connectivity of planar graphs which are regular of degree three. It is easily proven that no
such graph … and investigate cyclic connectivity for general planar graphs. Any terminology not …

… (and hence for all 5-connected) planar graphs. In this paper we settle the … planar graphs
and this is best possible in the sense that there are arbitrarily large 3-connected planar graphs …

… planar graph Gϕ that can be augmented with a perfect leaf matching if and only if ϕ is satisfiable.
The graph … We seek a minimum-cost augmentation of a given plane graph G such that …

… Related keywords are graph augmentation from the field of graph algorithms and mesh …
for planar graphs under the constraint to satisfy 4-connectivity. A 4-connected planar graph has …

… we study some connectivity augmentation problems. We want to make planar graphs 2-vertex
(or 2-edge) connected by adding edges such that the resulting graphs remain planar. We …

… low-connectivity network design problems, in which the maximum connectivity requirement
… This work focuses on {0, 1, 2}-edge connectivity problems in planar graphs. We consider the …

… In Section 2, we establish some key properties of two-edge-connectivity between boundary
vertices of a planar graph. In Section 3, we prove Theorem 2 by giving a linear-time algorithm …

… consider plane graphs, that is planar graphs embedded in the plane. Each connected
component of the complement in the plane of the vertex and edge sets is a face region of the graph…

… The above mentioned result shows£(2) (For infinite graphs such a function does not exist,
because there are infinite planar graphs of arbitrarily great (finite) connectivity and without …

… two-edge connectivity in planar graphs … The main result of our paper improves the embedded
planar graph result of Frederickson for 2-edge connectivity by a factor of log IZ. Our data …