On Boolean characterizations of planarity and planar embeddings of graphs

DOI10.1007/BF02216821zbMATH Open0724.05020OpenAlexW2000480468MaRDI QIDQ2276969FDOQ2276969

Authors: 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

Recommendations

• Boolean planarity characterization of graphs
• Boolean approach to planar embeddings of a graph
• On the linearity of testing planarity of graphs
• Another characterisation of planar graphs
• A new planarity test

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)

Cites Work

• Efficient Planarity Testing
• Title not available (Why is that?)
• Planar Graphs
• On the linearity of testing planarity of graphs
• A new approach to the linearity of testing planarity of graphs
• Title not available (Why is that?)
• Non-Separable and Planar Graphs
• Toward a theory of crossing numbers
• A Depth-First-Search Characterization of Planarity
• A structural characterization of planar combinatorial graphs
• Title not available (Why is that?)
• Preuve Algebrique Du Critere De Planarite De Wu-Liu
• Title not available (Why is that?)

Cited In (6)

• Boolean approaches to graph embeddings related to VLSI
• Another characterisation of planar graphs
• Title not available (Why is that?)
• Boolean approach to planar embeddings 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: On Boolean characterizations of planarity and planar embeddings of graphs

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