A characterization of DFS cotree critical graphs
De Fraysseix, Hubert ; Ossona De Mendez, Patrice
HAL, hal-00005642 / Harvested from HAL
Text on HAL
We give a characterization of DFS-cotree critical graphs which is central to the linear time Kuratowski finding algorithm implemented in PIGALE
Publié le : 2002-07-05
Classification:  [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] 
@article{hal-00005642,
     author = {De Fraysseix, Hubert and Ossona De Mendez, Patrice},
     title = {A characterization of DFS cotree critical graphs},
     journal = {HAL},
     volume = {2002},
     number = {0},
     year = {2002},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-00005642}
}

De Fraysseix, Hubert; Ossona De Mendez, Patrice. A characterization of DFS cotree critical graphs. HAL, Tome 2002 (2002) no. 0, . http://gdmltest.u-ga.fr/item/hal-00005642/