Boolean approach to planar embeddings of a graph

DOI10.1007/BF02107624zbMath0780.05017MaRDI QIDQ4271303

Yanpei Liu

Publication date: 1 December 1993

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

zbMATH Keywords

spanning treeplanaritycomponentsplanar embeddingsHamiltonian planar graph

Mathematics Subject Classification ID

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

Related Items (4)

Orthogonal drawings of graphs for the automation of VLSI circuit design ⋮ Theoretical results on at most 1-bend embeddability of graphs ⋮ General theoretical results on rectilinear embeddability of graphs ⋮ 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

This page was built for publication: Boolean approach to planar embeddings of a graph