Boolean planarity characterization of graphs
From MaRDI portal
Publication:3824429
DOI10.1007/BF02560635zbMath0671.05031OpenAlexW2008703245MaRDI QIDQ3824429
Publication date: 1988
Published in: Acta Mathematica Sinica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02560635
Related Items (2)
Orthogonal drawings of graphs for the automation of VLSI circuit design ⋮ Boolean approaches to graph embeddings related to VLSI
Cites Work
This page was built for publication: Boolean planarity characterization of graphs