An algorithm to find a Kuratowski subdivision in DFS cotree critical graphs
De Fraysseix, Hubert ; Ossona De Mendez, Patrice
HAL, hal-00005640 / Harvested from HAL
Text on HAL
We present a simple linear time algorithm finding a Kuratowski subdivision in a DFS cotree critical graphs, based on recent theoretical results. For sake of clarity, we shall outline the proofs of the Theorem we make use of. This algorithm is the last part of the two step linear time Kuratowski finding algorithm implemented in PIGALE (``Public Implementation of a Graph Algorithm Library and Editor'')
Publié le : 2001-07-05
Classification:  [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] 
@article{hal-00005640,
     author = {De Fraysseix, Hubert and Ossona De Mendez, Patrice},
     title = {An algorithm to find a Kuratowski subdivision in DFS cotree critical graphs},
     journal = {HAL},
     volume = {2001},
     number = {0},
     year = {2001},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-00005640}
}

De Fraysseix, Hubert; Ossona De Mendez, Patrice. An algorithm to find a Kuratowski subdivision in DFS cotree critical graphs. HAL, Tome 2001 (2001) no. 0, . http://gdmltest.u-ga.fr/item/hal-00005640/