Boolean planarity characterization of graphs

DOI10.1007/BF02560635MaRDI QIDQ3824429zbMATH OpenOpenAlexFDO

Authors Yanpei Liu

Publication date 1988

Published in Acta Mathematica Sinica, English Series (Search for Journal in Brave)

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

zbMATH Keywords

Boolean techniqueplanarity testing

Mathematics Subject Classification ID

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

Recommendations

• On Boolean characterizations of planarity and planar embeddings of graphs
• On the linearity of testing planarity of graphs
• A criterion for the planarity of a graph
• A new planarity test
• Boolean approach to planar embeddings of a graph

Cites work

• Efficient Planarity Testing
• scientific article; zbMATH DE number 3116364 (Why is no real title available?)
• scientific article; zbMATH DE number 3165199 (Why is no real title available?)
• scientific article; zbMATH DE number 3249560 (Why is no real title available?)
• On the linearity of testing planarity of graphs
• Toward a theory of crossing numbers

Cited in

(8)

• On the linearity of testing planarity of graphs
• Boolean approaches to graph embeddings related to VLSI
• Orthogonal drawings of graphs for the automation of VLSI circuit design
• On Boolean characterizations of planarity and planar embeddings of graphs
• Another characterisation of planar graphs
• A criterion for the planarity of a graph
• Boolean approach to planar embeddings of a graph
• Boolean-width of graphs

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

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