TRÉMAUX TREES AND PLANARITY

DOI10.1142/S0129054106004248zbMath1100.68076arXivmath/0610935WikidataQ29035598 ScholiaQ29035598MaRDI QIDQ5493892

Patrice Ossona de Mendez, Pierre Rosenstiehl, Hubert de Fraysseix

Publication date: 16 October 2006

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0610935

zbMATH Keywords

PIGALE

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Planarity Algorithms via PQ-Trees (Extended Abstract) ⋮ Trémaux Trees and Planarity ⋮ On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves ⋮ Clustered planarity testing revisited ⋮ An annotated review on graph drawing and its applications ⋮ Treetopes and their graphs ⋮ Trémaux trees and planarity ⋮ A computational approach to Conway's thrackle conjecture ⋮ Testing gap \(k\)-planarity is NP-complete ⋮ $$\textit{\textbf{k}}$$-Planar Graphs

Uses Software

• PIGALE

Cites Work

• A characterization of planar graphs by Trémaux orders
• Efficient Planarity Testing