TRÉMAUX TREES AND PLANARITY
HUBERT DE FRAYSSEIX, Patrice Ossona de Mendez, PIERRE ROSENSTIEHL · International Journal of Foundations of Computer Science · 2006
We present a simplified version of the DFS-based Left-Right planarity testing and embedding algorithm implemented in Pigale [1, 2], which has been considered as the fastest implemented one [3]. We give here a full justification of the algorithm, based on a topological properties of Trémaux trees.