Journal ArticleOPEN ACCESS

Depth-First Search and Kuratowski Subgraphs

Journal of the ACM (JACM) (1984) 31(4) 681-693
DOI: 10.1145/1634.322451
53Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

Lel G = (V, E) be a nonplanar graph. The method of using depth-first techniques to extract a Kuratowski., ubgraph in time O( I V[ ) is shown. © 1984, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Williamson, S. G. (1984). Depth-First Search and Kuratowski Subgraphs. Journal of the ACM (JACM), 31(4), 681–693. https://doi.org/10.1145/1634.322451

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