Connectivity of planar graphs
De Fraysseix, Hubert ; Ossona De Mendez, Patrice
HAL, hal-00005627 / Harvested from HAL
Text on HAL
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.
Publié le : 2001-07-05
Classification:  graph theory,  orientation,  connectiveness,  05C85, 05C75,  [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] 
@article{hal-00005627,
     author = {De Fraysseix, Hubert and Ossona De Mendez, Patrice},
     title = {Connectivity of planar graphs},
     journal = {HAL},
     volume = {2001},
     number = {0},
     year = {2001},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-00005627}
}

De Fraysseix, Hubert; Ossona De Mendez, Patrice. Connectivity of planar graphs. HAL, Tome 2001 (2001) no. 0, . http://gdmltest.u-ga.fr/item/hal-00005627/