A characterization of planar graphs by Trémaux orders

DOI10.1007/BF02579375zbMath0577.05029OpenAlexW1989666671WikidataQ57380601 ScholiaQ57380601MaRDI QIDQ1065816

Pierre Rosenstiehl, Hubert de Fraysseix

Publication date: 1985

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579375

zbMATH Keywords

planar graphsplanarity testingDepth-First-Search treeTrémaux tree

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

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 ⋮ A Direct Proof of the Strong Hanani–Tutte Theorem on the Projective Plane ⋮ Orthogonal drawings of graphs for the automation of VLSI circuit design ⋮ Trémaux trees and planarity ⋮ Efficient Extraction of Multiple Kuratowski Subdivisions ⋮ Compact distributed certification of planar graphs ⋮ Unnamed Item ⋮ TRÉMAUX TREES AND PLANARITY

Cites Work

• Embedding Graphs in the Plane—Algorithmic Aspects
• Preuve Algebrique Du Critere De Planarite De Wu-Liu
• Efficient Planarity Testing
• Toward a theory of crossing numbers
• Unnamed Item