Connectivity of planar graphs

Hubert de Fraysseix (1) , Patrice Ossona de Mendez (1)

1 CAMS - Centre d'Analyse et de Mathématique sociales

We give here three simple linear time algorithms on planar graphs: a 4-connexity test for maximal planar graphs, an algorithm enumerating the triangles and a 3-connexity test. Although all these problems got already linear-time solutions, the presented algorithms are both simple and efficient. They are based on some new theoretical results.

Mots clés: graph theory; orientation; connectiveness

Domaines: Combinatoire [math.CO]

Hubert de Fraysseix, Patrice Ossona de Mendez. Connectivity of planar graphs. Journal of Graph Algorithms and Applications, 2001, 5(5), pp.93-105. ⟨hal-00005627⟩