On cotree-critical and DFS cotree-critical graphs. - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Graph Algorithms and Applications Année : 2003

On cotree-critical and DFS cotree-critical graphs.

Résumé

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 an algorithm for finding a Kuratowski subdivision in a DFS cotree-critical graph.
Fichier non déposé

Dates et versions

hal-00005630 , version 1 (26-06-2005)

Identifiants

  • HAL Id : hal-00005630 , version 1

Citer

Hubert de Fraysseix, Patrice Ossona de Mendez. On cotree-critical and DFS cotree-critical graphs.. Journal of Graph Algorithms and Applications, 2003, 7(4), pp.411-427. ⟨hal-00005630⟩

Collections

CNRS EHESS
58 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More