Trémaux trees and planarity

Authors:
Hubert de Fraysseix;Patrice Ossona de Mendez
Affiliations:
-;-
Venue:
European Journal of Combinatorics
Year:
2012

Citing 4
Cited 0

Efficient Planarity Testing

Journal of the ACM (JACM)
Algorithm 447: efficient algorithms for graph manipulation

Communications of the ACM
Graph Algorithms

Graph Algorithms
A Characterization of DFS Cotree Critical Graphs

GD '01 Revised Papers from the 9th International Symposium on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a characterization of planarity based on Tremaux trees (i.e. DFS trees), from which we deduce a rather simple planarity test algorithm. We finally recall a theorem on ''cotree critical non-planar graphs'' which very much simplifies the search for a Kuratowski subdivision in a non-planar graph.