Conference ProceedingsOPEN ACCESS

A characterization of DFS cotree critical graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2265 LNCS 84-95
DOI: 10.1007/3-540-45848-4_7
6Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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

Cite

CITATION STYLE

APA

De Fraysseix, H., & De Mendez, P. O. (2002). A characterization of DFS cotree critical graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2265 LNCS, pp. 84–95). Springer Verlag. https://doi.org/10.1007/3-540-45848-4_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free