Pages that link to "Item:Q1210238"
From MaRDI portal
The following pages link to Theoretical results on at most 1-bend embeddability of graphs (Q1210238):
Displaying 9 items.
- Orthogonal graph drawing with flexibility constraints (Q476441) (← links)
- Advances in the theory and practice of graph drawing (Q1285778) (← links)
- Some combinatorial optimization problems arising from VLSI circuit design (Q1319148) (← links)
- At most single-bend embeddings of cubic graphs (Q1335404) (← links)
- Boolean approaches to graph embeddings related to VLSI (Q1609705) (← links)
- Drawing planar graphs using the canonical ordering (Q1920418) (← links)
- Orthogonal drawings of graphs for the automation of VLSI circuit design (Q1966107) (← links)
- Orthogeodesic point-set embedding of trees (Q2391540) (← links)
- On the net-embeddability of graphs (Q5288744) (← links)
