Sciweavers

GD
2001
Springer

A Characterization of DFS Cotree Critical Graphs

14 years 4 months ago
A Characterization of DFS Cotree Critical Graphs
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. Communicated by: P. Mutzel and M. J¨unger; submitted May 2002; revised August 2003.
Hubert de Fraysseix, Patrice Ossona de Mendez
Added 28 Jul 2010
Updated 28 Jul 2010
Type Conference
Year 2001
Where GD
Authors Hubert de Fraysseix, Patrice Ossona de Mendez
Comments (0)