Pages that link to "Item:Q5200497"
From MaRDI portal
The following pages link to h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area (Q5200497):
Displaying 9 items.
- Topological morphing of planar graphs (Q386891) (← links)
- A linear-time algorithm for testing outer-1-planarity (Q494794) (← links)
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs (Q904086) (← links)
- 1-bend upward planar slope number of SP-digraphs (Q2206732) (← links)
- Fan-planarity: properties and complexity (Q2346379) (← links)
- Area requirement of graph drawings with few crossings per edge (Q2391538) (← links)
- Drawing partial 2-trees with few slopes (Q2701381) (← links)
- Parameters Tied to Treewidth (Q2978180) (← links)
- Quasi-planar Graphs (Q5001655) (← links)
