We present a characterization of planarity based on Trémaux 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.
