On Cotree-Critical and DFS Cotree-Critical Graphs
Hubert de Fraysseix, Patrice Ossona de Mendez · Journal of Graph Algorithms and Applications · 2003
We give a characterization of DFS cotree-critical graphs which is central to the linear time Kuratowski finding algorithm implemented in PIGALE (Public Implementation of a Graph Algorithm Library and Editor [2]) by the authors, and deduce a justification of a very simple algorithm for finding a Kuratowski subdivision in a DFS cotree-critical graph.