Trémaux trees and planarity

DOI10.1016/j.ejc.2011.09.012zbMath1230.05116OpenAlexW1965678978WikidataQ30053607 ScholiaQ30053607MaRDI QIDQ661936

Patrice Ossona de Mendez, Hubert de Fraysseix

Publication date: 11 February 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2011.09.012

Mathematics Subject Classification ID

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

Related Items (4)

On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves ⋮ Grid recognition: classical and parameterized computational perspectives ⋮ A Direct Proof of the Strong Hanani–Tutte Theorem on the Projective Plane ⋮ Data Structures and their Planar Graph Layouts

Uses Software

• PIGALE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Dividing a Graph into Triconnected Components
• Graph Drawing
• TRÉMAUX TREES AND PLANARITY
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Trémaux trees and planarity