Pages that link to "Item:Q4271303"
From MaRDI portal
The following pages link to Boolean approach to planar embeddings of a graph (Q4271303):
Displaying 7 items.
- General theoretical results on rectilinear embeddability of graphs (Q809088) (← links)
- Theoretical results on at most 1-bend embeddability of graphs (Q1210238) (← links)
- On counting planar embeddings (Q1313885) (← links)
- Boolean approaches to graph embeddings related to VLSI (Q1609705) (← links)
- Orthogonal drawings of graphs for the automation of VLSI circuit design (Q1966107) (← links)
- Boolean planarity characterization of graphs (Q3824429) (← links)
- Hanani-Tutte for approximating maps of graphs (Q5115807) (← links)