Planarity and Trémaux trees
Résumé
We present a characterization of planarity based on Trémaux trees (i.e. DFS trees), from which we deduce a simple and efficient planarity test algorithm. We finally recall a theorem on ''cotree critical non-planar graphs" which very much simplify the search of a Kuratowski subdivision in a non-planar graph.