Pages that link to "Item:Q719252"
From MaRDI portal
The following pages link to Drawing graphs with right angle crossings (Q719252):
Displaying 46 items.
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- Circular right-angle crossing drawings in linear time (Q301590) (← links)
- A note on 1-planar graphs (Q401145) (← links)
- Vertex angle and crossing angle resolution of leveled tree drawings (Q456065) (← links)
- 2-layer right angle crossing drawings (Q476445) (← links)
- RAC drawings in subcubic area (Q783679) (← links)
- L-visibility drawings of IC-planar graphs (Q903189) (← links)
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs (Q904086) (← links)
- On fan-crossing and fan-crossing free graphs (Q1653045) (← links)
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs (Q1702255) (← links)
- 1-fan-bundle-planar drawings of graphs (Q1708027) (← links)
- A heuristic approach towards drawings of graphs with high crossing resolution (Q1725757) (← links)
- A greedy heuristic for crossing-angle maximization (Q1725762) (← links)
- A linear-time algorithm for testing full outer-2-planarity (Q1727743) (← links)
- Right angle crossing graphs and 1-planarity (Q1949102) (← links)
- 1-planarity testing and embedding: an experimental study (Q2088879) (← links)
- The density of fan-planar graphs (Q2121760) (← links)
- Simplifying non-simple fan-planar drawings (Q2151431) (← links)
- RAC-drawability is \(\exists \mathbb{R} \)-complete (Q2151432) (← links)
- Recognizing and embedding simple optimal 2-planar graphs (Q2151433) (← links)
- Arrangements of orthogonal circles with many intersections (Q2151458) (← links)
- Limitations on realistic hyperbolic graph drawing (Q2151459) (← links)
- Colored anchored visibility representations in 2D and 3D space (Q2206717) (← links)
- Efficient generation of different topological representations of graphs beyond-planarity (Q2206855) (← links)
- Re-embedding a 1-plane graph for a straight-line drawing in linear time (Q2235768) (← 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)
- \(\mathsf{NIC}\)-planar graphs (Q2410219) (← links)
- Fan-crossing free graphs and their relationship to other beyond-planar graphs (Q2663047) (← links)
- Testing Full Outer-2-planarity in Linear Time (Q2827826) (← links)
- On the Number of Edges of Fan-Crossing Free Graphs (Q2872081) (← links)
- On the Density of Non-simple 3-Planar Graphs (Q2961527) (← links)
- The Stub Resolution of 1-planar Graphs (Q5084699) (← links)
- Crossing Numbers of Beyond-Planar Graphs Revisited (Q5084712) (← links)
- (Q5091019) (← links)
- (Q5111244) (← links)
- Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity (Q5141643) (← links)
- (Q5874523) (← links)
- Arrangements of orthogonal circles with many intersections (Q5886035) (← links)
- Simplifying Non-Simple Fan-Planar Drawings (Q5886039) (← links)
- Combinatorial properties and recognition of unit square visibility graphs (Q6045782) (← links)
- Shallow Minors, Graph Products, and Beyond-Planar Graphs (Q6130539) (← links)
- (Q6179340) (← links)
- RAC-Drawability is ∃ℝ-complete and Related Results (Q6181953) (← links)
