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 42 items.
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- A linear-time algorithm for testing outer-1-planarity (Q494794) (← links)
- On partitioning the edges of 1-plane graphs (Q501676) (← links)
- On the edge crossing properties of Euclidean minimum weight Laman graphs (Q902420) (← links)
- On fan-crossing and fan-crossing free graphs (Q1653045) (← links)
- Linear-time recognition of map graphs with outerplanar witness (Q1662161) (← links)
- Recognizing optimal 1-planar graphs in linear time (Q1702117) (← links)
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs (Q1702255) (← links)
- 1-fan-bundle-planar drawings of graphs (Q1708027) (← links)
- A linear-time algorithm for testing full outer-2-planarity (Q1727743) (← links)
- Characterizing and recognizing 4-map graphs (Q1741846) (← links)
- Gap-planar graphs (Q1786592) (← links)
- Testing gap \(k\)-planarity is NP-complete (Q2032139) (← links)
- Planar graphs having no proper 2-immersions in the plane. I (Q2037555) (← links)
- 1-planarity testing and embedding: an experimental study (Q2088879) (← links)
- Counting cliques in 1-planar graphs (Q2111191) (← links)
- The density of fan-planar graphs (Q2121760) (← links)
- A survey on book-embedding of planar graphs (Q2141323) (← links)
- Fixed-parameter tractability for book drawing with bounded number of crossings per edge (Q2151389) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Re-embedding a 1-plane graph for a straight-line drawing in linear time (Q2235768) (← links)
- Characterizing 5-map graphs by 2-fan-crossing graphs (Q2274073) (← links)
- On 3D visibility representations of graphs with few crossings per edge (Q2317866) (← links)
- Fan-planarity: properties and complexity (Q2346379) (← links)
- On RAC drawings of 1-planar graphs (Q2402260) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- On the recognition of fan-planar and maximal outer-fan-planar graphs (Q2408919) (← links)
- The book thickness of 1-planar graphs is constant (Q2408921) (← links)
- \(\mathsf{NIC}\)-planar graphs (Q2410219) (← links)
- Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets (Q2412632) (← links)
- Fan-crossing free graphs and their relationship to other beyond-planar graphs (Q2663047) (← links)
- A fast algorithm for the product structure of planar graphs (Q2663717) (← links)
- Testing Full Outer-2-planarity in Linear Time (Q2827826) (← links)
- On the Number of Edges of Fan-Crossing Free Graphs (Q2872081) (← links)
- A Note on the Minimum H-Subgraph Edge Deletion (Q2947962) (← links)
- Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time (Q2961525) (← links)
- On the Density of Non-simple 3-Planar Graphs (Q2961527) (← links)
- (Q5089197) (← links)
- Complexity of Geometric k-Planarity for Fixed k (Q5144878) (← links)
- All 2-planar graphs having the same spanning subgraph (Q6087085) (← links)
- Weak-dynamic coloring of graphs beyond-planarity (Q6144496) (← links)
- Treewidth, Circle Graphs, and Circular Drawings (Q6195956) (← links)
