Pages that link to "Item:Q1727743"
From MaRDI portal
The following pages link to A linear-time algorithm for testing full outer-2-planarity (Q1727743):
Displaying 14 items.
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system (Q391976) (← links)
- A linear-time algorithm for testing outer-1-planarity (Q494794) (← links)
- The density of fan-planar graphs (Q2121760) (← links)
- Recognizing and embedding simple optimal 2-planar graphs (Q2151433) (← links)
- Testing Full Outer-2-planarity in Linear Time (Q2827826) (← links)
- A direct linear-time planarity test for unflippable modules (Q3804209) (← links)
- (Q4702944) (← links)
- An algorithm for an 𝓁<sup>2</sup>-homological test for the planarity of a graph (Q4956221) (← links)
- Beyond Planar Graphs: Introduction (Q5001653) (← links)
- Algorithms for 1-Planar Graphs (Q5001657) (← links)
- 2-Layer k-Planar Graphs (Q5014133) (← links)
- Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time (Q5014135) (← links)
- Fully-dynamic planarity testing in polylogarithmic time (Q5144906) (← links)
- On RAC drawings of graphs with one bend per edge (Q5918835) (← links)