scientific article; zbMATH DE number 3165199
From MaRDI portal
Publication:3283487
zbMATH Open0101.16704MaRDI QIDQ3283487FDOQ3283487
Authors: Louis Auslander, Seymour V. Parter 
Publication date: 1961
Title of this publication is not available (Why is that?)
Cited In (15)
- Facilities layout generalized model solved by n-boundary shortest path heuristics
- Reconstruction graphs and testing their properties in a relational spatial database
- An annotated review on graph drawing and its applications
- Simultaneous orthogonal planarity
- A linear algorithm for embedding planar graphs using PQ-trees
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- On Boolean characterizations of planarity and planar embeddings of graphs
- Improved planarity algorithms
- Boolean approach to planar embeddings of a graph
- An algorithm for straight-line representation of simple planar graphs
- Alcuni sviluppi sulla teoria relativa dei singrammi finiti
- On the decomposition of a complete graph into planar subgraphs
- Jordan circuits of a graph
- Orthogonal drawings of graphs for the automation of VLSI circuit design
- Boolean planarity characterization of graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3283487)
