scientific article
From MaRDI portal
Publication:3283487
zbMath0101.16704MaRDI QIDQ3283487
Louis Auslander, Seymour V. Parter
Publication date: 1961
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (15)
A linear algorithm for embedding planar graphs using PQ-trees ⋮ Boolean approach to planar embeddings of a graph ⋮ Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth ⋮ An annotated review on graph drawing and its applications ⋮ Simultaneous Orthogonal Planarity ⋮ Improved planarity algorithms ⋮ Orthogonal drawings of graphs for the automation of VLSI circuit design ⋮ Boolean planarity characterization of graphs ⋮ On Boolean characterizations of planarity and planar embeddings of graphs ⋮ Alcuni sviluppi sulla teoria relativa dei singrammi finiti ⋮ On the decomposition of a complete graph into planar subgraphs ⋮ An algorithm for straight-line representation of simple planar graphs ⋮ Facilities layout generalized model solved by n-boundary shortest path heuristics ⋮ Jordan circuits of a graph ⋮ Reconstruction graphs and testing their properties in a relational spatial database
This page was built for publication:
