Trémaux Trees and Planarity

DOI10.1016/j.endm.2008.06.035zbMath1267.05063OpenAlexW2597215150MaRDI QIDQ5301003

Hubert de Fraysseix

Publication date: 28 June 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2008.06.035

zbMATH Keywords

depth first search treesKuratowski subdivisioncotree critical non-planar graphsHopcroft-Tarjan planarity algorithmplanarity test algorithmTremaux trees

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves ⋮ An annotated review on graph drawing and its applications

Uses Software

• PIGALE

Cites Work

• A characterization of planar graphs by Trémaux orders
• A Depth-First-Search Characterization of Planarity
• Efficient Planarity Testing
• On Cotree-Critical and DFS Cotree-Critical Graphs
• Graph Drawing
• TRÉMAUX TREES AND PLANARITY
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Trémaux Trees and Planarity