A Depth-First-Search Characterization of Planarity
From MaRDI portal
Publication:3960721
DOI10.1016/S0304-0208(08)73550-3zbMath0497.05026MaRDI 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)
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory
Related Items
Recent Advances in Exact Crossing Minimization (Extended Abstract), Trémaux Trees and Planarity, Trémaux trees and planarity, Bipartite graphs, upward drawings, and planarity, Upward drawings of triconnected digraphs., Representations of graphs and networks (coding, layouts and embeddings), Area requirement and symmetry display of planar upward drawings, A large set of torus obstructions and how they were discovered, Facilities layout generalized model solved by n-boundary shortest path heuristics, Upward planarity testing, On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm, Orthogonal drawings of graphs for the automation of VLSI circuit design, On Boolean characterizations of planarity and planar embeddings of graphs, Unnamed Item
