Pages that link to "Item:Q1272189"
From MaRDI portal
The following pages link to Graphs drawn with few crossings per edge (Q1272189):
Displaying 8 items.
- The Szemerédi-Trotter theorem in the complex plane (Q276440) (← links)
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs (Q904086) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- Right angle crossing graphs and 1-planarity (Q1949102) (← links)
- Area requirement of graph drawings with few crossings per edge (Q2391538) (← links)
- The book thickness of 1-planar graphs is constant (Q2408921) (← links)
- EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING (Q5300010) (← links)