A Characterization of DFS Cotree Critical Graphs

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 PIGALE1.

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: de Fraysseix, Hubert, Ossona de Mendez, Patrice
Format: Buchkapitel
Sprache:eng
Schlagworte:
Applied sciences
Artificial intelligence
Computer science
control theory
systems
Disjoint Path
Exact sciences and technology
Hamiltonian Path
Pattern recognition. Digital image processing. Computational geometry
Planar Graph
Simple Graph
Simple Path
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We give a characterization of DFS-cotree critical graphs which is central to the linear time Kuratowski finding algorithm implemented in PIGALE1.
ISSN:0302-9743
1611-3349
DOI:10.1007/3-540-45848-4_7