Boolean approach to planar embeddings of a graph
From MaRDI portal
Recommendations
- On Boolean characterizations of planarity and planar embeddings of graphs
- Boolean planarity characterization of graphs
- Graph Drawing
- Planar Embeddings of Graphs with Specified Edge Lengths
- scientific article; zbMATH DE number 3968606
- scientific article; zbMATH DE number 432759
- scientific article; zbMATH DE number 1696626
- Bounded Embeddings of Graphs in the Plane
- Simultaneous embedding of embedded planar graphs
- Simultaneous embedding of embedded planar graphs
Cites work
Cited in
(9)- Theoretical results on at most 1-bend embeddability of graphs
- On counting planar embeddings
- 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
- Boolean planarity characterization of graphs
- scientific article; zbMATH DE number 1792067 (Why is no real title available?)
- Hanani-Tutte for approximating maps of graphs
- General theoretical results on rectilinear embeddability of graphs
This page was built for publication: Boolean approach to planar embeddings of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4271303)