A Characterization of DFS Cotree Critical Graphs

De Fraysseix, Hubert and Ossona de Mendez, Patrice (2002) A Characterization of DFS Cotree Critical Graphs. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001 , pp. 84-95(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_7).

Full text not available from this repository.

Abstract

We give a characterization of DFS-cotree critical graphs which is central to the linear time Kuratowski finding algorithm implemented in PIGALE.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-45848-4_7
Classifications: Z Theory > Z.001 General
G Algorithms and Complexity > G.999 Others
G Algorithms and Complexity > G.770 Planarity Testing
URI: http://gdea.informatik.uni-koeln.de/id/eprint/403

Actions (login required)

View Item View Item