On Boolean characterizations of planarity and planar embeddings of graphs

DOI10.1007/BF02216821zbMath0724.05020OpenAlexW2000480468MaRDI QIDQ2276969

Yanpei Liu

Publication date: 1990

Published in: Annals of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

planarity testingquadratic Boolean equationfinding a planar imbeddingmaximal planar subgraphsplanarity characterizationplanarity obstacles

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the linearity of testing planarity of graphs
• A new approach to the linearity of testing planarity of graphs
• A structural characterization of planar combinatorial graphs
• Preuve Algebrique Du Critere De Planarite De Wu-Liu
• A Depth-First-Search Characterization of Planarity
• Efficient Planarity Testing
• Non-Separable and Planar Graphs
• Planar Graphs
• Toward a theory of crossing numbers

This page was built for publication: On Boolean characterizations of planarity and planar embeddings of graphs