Pages that link to "Item:Q494794"
From MaRDI portal
The following pages link to A linear-time algorithm for testing outer-1-planarity (Q494794):
Displaying 26 items.
- On fan-crossing and fan-crossing free graphs (Q1653045) (← links)
- Recognizing optimal 1-planar graphs in linear time (Q1702117) (← links)
- 1-fan-bundle-planar drawings of graphs (Q1708027) (← links)
- Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity (Q1725786) (← 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)
- Linear arboricity of outer-1-planar graphs (Q2033994) (← links)
- 1-planarity testing and embedding: an experimental study (Q2088879) (← links)
- Recognizing and embedding simple optimal 2-planar graphs (Q2151433) (← links)
- Optimal-area visibility representations of outer-1-plane graphs (Q2151451) (← links)
- Re-embedding a 1-plane graph for a straight-line drawing in linear time (Q2235768) (← links)
- Remarks on the joins of 1-planar graphs (Q2286052) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- \(\mathsf{NIC}\)-planar graphs (Q2410219) (← links)
- Testing Full Outer-2-planarity in Linear Time (Q2827826) (← links)
- Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time (Q2961525) (← links)
- Recognizing IC-Planar and NIC-Planar Graphs (Q4566013) (← links)
- Gap-Planar Graphs (Q4625141) (← links)
- Beyond Outerplanarity (Q4625142) (← links)
- Beyond Planar Graphs: Introduction (Q5001653) (← links)
- Algorithms for 1-Planar Graphs (Q5001657) (← links)
- 2-Layer k-Planar Graphs (Q5014133) (← links)
- (Q5091019) (← links)
- On Aligned Bar 1-Visibility Graphs (Q5890623) (← links)
- Strong Edge Coloring of Outerplane Graphs with Independent Crossings (Q6489818) (← links)
