A Simple Planarity Criterion

DOI10.1145/321879.321885zbMATH Open0309.05106OpenAlexW2033701679MaRDI QIDQ4067129FDOQ4067129

Authors: Bernd Knauer 

Publication date: 1975

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321879.321885

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cited In (1)

• Orthogonal drawings of graphs for the automation of VLSI circuit design

This page was built for publication: A Simple Planarity Criterion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4067129)