Pages that link to "Item:Q1335404"
From MaRDI portal
The following pages link to At most single-bend embeddings of cubic graphs (Q1335404):
Displaying 8 items.
- Theoretical results on at most 1-bend embeddability of graphs (Q1210238) (← links)
- Some combinatorial optimization problems arising from VLSI circuit design (Q1319148) (← 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)
- Grid straight-line embeddings of trees with a minimum number of bends per path (Q2059894) (← links)
- Variants of the segment number of a graph (Q2206875) (← links)
- An efficient orthogonal grid drawing algorithm for cubic graphs (Q6064011) (← links)