On Cotree-Critical and DFS Cotree-Critical Graphs
Vol. 7, no. 4, pp. 411-427, 2003. Regular paper.
Abstract 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 []) by the authors, and deduce a justification of a very simple algorithm for finding a Kuratowski subdivision in a DFS cotree-critical graph.
Submitted: May 2002.
Revised: August 2003.
Communicated by Petra Mutzel and Michael J√ľnger
article (PDF)