Title of article
Trémaux trees and planarity
Author/Authors
de Fraysseix، نويسنده , , Hubert and Ossona de Mendez، نويسنده , , Patrice، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2012
Pages
15
From page
279
To page
293
Abstract
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.
Journal title
European Journal of Combinatorics
Serial Year
2012
Journal title
European Journal of Combinatorics
Record number
1547821
Link To Document