Pages that link to "Item:Q2461632"
From MaRDI portal
The following pages link to Algorithms for graphs embeddable with few crossings per edge (Q2461632):
Displaying 13 items.
- (Q5089197) (← links)
- Complexity of Geometric k-Planarity for Fixed k (Q5144878) (← links)
- Structure of Graphs with Locally Restricted Crossings (Q5346557) (← links)
- Fundamentals of Computation Theory (Q5492943) (← links)
- All 2-planar graphs having the same spanning subgraph (Q6087085) (← links)
- The family of fan-planar graphs (Q6091140) (← links)
- Weak-dynamic coloring of graphs beyond-planarity (Q6144496) (← links)
- Treewidth, Circle Graphs, and Circular Drawings (Q6195956) (← links)
- Min-\(k\)-planar drawings of graphs (Q6560142) (← links)
- Parameterized algorithms for fixed-order book drawing with few crossings per edge (Q6569894) (← links)
- Min-\(k\)-planar drawings of graphs (Q6616240) (← links)
- Cops and robbers on 1-planar graphs (Q6618244) (← links)
- Upward and orthogonal planarity are W[1]-hard parameterized by treewidth (Q6618262) (← links)