An algorithm to find a Kuratowski subdivision in DFS cotree critical graphs

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

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

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'')

Domaines: Combinatoire [math.CO]

Hubert de Fraysseix, Patrice Ossona de Mendez. An algorithm to find a Kuratowski subdivision in DFS cotree critical graphs. 2001, pp.98-105. ⟨hal-00005640⟩