A Depth-First-Search Characterization of Planarity
From MaRDI portal
Publication:3960721
DOI10.1016/S0304-0208(08)73550-3zbMath0497.05026OpenAlexW1855700180MaRDI QIDQ3960721
Pierre Rosenstiehl, Hubert de Fraysseix
Publication date: 1982
Published in: Graph Theory, Proceedings of the Conference on Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73550-3
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (16)
Unnamed Item ⋮ Recent Advances in Exact Crossing Minimization (Extended Abstract) ⋮ Trémaux Trees and Planarity ⋮ Upward planarity testing ⋮ On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm ⋮ Planarity for clustered graphs ⋮ A large set of torus obstructions and how they were discovered ⋮ Bipartite graphs, upward drawings, and planarity ⋮ Orthogonal drawings of graphs for the automation of VLSI circuit design ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Trémaux trees and planarity ⋮ Area requirement and symmetry display of planar upward drawings ⋮ Upward drawings of triconnected digraphs. ⋮ On Boolean characterizations of planarity and planar embeddings of graphs ⋮ Triangulating planar graphs while minimizing the maximum degree ⋮ Facilities layout generalized model solved by n-boundary shortest path heuristics
This page was built for publication: A Depth-First-Search Characterization of Planarity
