Pages that link to "Item:Q2391538"
From MaRDI portal
The following pages link to Area requirement of graph drawings with few crossings per edge (Q2391538):
Displaying 8 items.
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs (Q904086) (← links)
- 1-page and 2-page drawings with bounded number of crossings per edge (Q1678086) (← links)
- Fixed-parameter tractability for book drawing with bounded number of crossings per edge (Q2151389) (← links)
- Fan-planarity: properties and complexity (Q2346379) (← links)
- On RAC drawings of 1-planar graphs (Q2402260) (← links)
- Drawing partial 2-trees with few slopes (Q2701381) (← links)
- (Q5874523) (← links)
