Boolean planarity characterization of graphs

DOI10.1007/BF02560635zbMath0671.05031OpenAlexW2008703245MaRDI QIDQ3824429

Yanpei Liu

Publication date: 1988

Published in: Acta Mathematica Sinica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02560635

zbMATH Keywords

planarity testingBoolean technique

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (2)

Orthogonal drawings of graphs for the automation of VLSI circuit design ⋮ Boolean approaches to graph embeddings related to VLSI

Cites Work

• On the linearity of testing planarity of graphs
• Efficient Planarity Testing
• Toward a theory of crossing numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Boolean planarity characterization of graphs