Pages that link to "Item:Q5176857"
From MaRDI portal
The following pages link to 1-Planarity of Graphs with a Rotation System (Q5176857):
Displaying 21 items.
- Outer 1-planar graphs (Q289919) (← links)
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- On partitioning the edges of 1-plane graphs (Q501676) (← links)
- On fan-crossing and fan-crossing free graphs (Q1653045) (← links)
- Recognizing optimal 1-planar graphs in linear time (Q1702117) (← links)
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs (Q1702255) (← links)
- Characterizing and recognizing 4-map graphs (Q1741846) (← links)
- Gap-planar graphs (Q1786592) (← links)
- Embedding-preserving rectangle visibility representations of nonplanar graphs (Q1991089) (← links)
- 1-planarity testing and embedding: an experimental study (Q2088879) (← links)
- Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs (Q2220841) (← links)
- Characterizing 5-map graphs by 2-fan-crossing graphs (Q2274073) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- \(\mathsf{NIC}\)-planar graphs (Q2410219) (← links)
- Fan-crossing free graphs and their relationship to other beyond-planar graphs (Q2663047) (← links)
- Recognizing IC-Planar and NIC-Planar Graphs (Q4566013) (← links)
- Gap-Planar Graphs (Q4625141) (← links)
- Beyond Planar Graphs: Introduction (Q5001653) (← links)
- Quantitative Restrictions on Crossing Patterns (Q5001654) (← links)
- Algorithms for 1-Planar Graphs (Q5001657) (← links)
- Complexity of Geometric k-Planarity for Fixed k (Q5144878) (← links)
