Pages that link to "Item:Q1095918"
From MaRDI portal
The following pages link to On the linearity of testing planarity of graphs (Q1095918):
Displaying 18 items.
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system (Q391976) (← links)
- An algorithm of graph planarity testing and cross minimization (Q1049731) (← links)
- A new approach to the linearity of testing planarity of graphs (Q1117237) (← links)
- Orthogonal planarity testing of bounded treewidth graphs (Q2071827) (← links)
- On Boolean characterizations of planarity and planar embeddings of graphs (Q2276969) (← links)
- Testing Full Outer-2-planarity in Linear Time (Q2827826) (← links)
- A Planarity Test via Construction Sequences (Q2849960) (← links)
- (Q3338271) (← links)
- A criterion for the planarity of a graph (Q3752397) (← links)
- A direct linear-time planarity test for unflippable modules (Q3804209) (← links)
- Boolean planarity characterization of graphs (Q3824429) (← links)
- Boolean approach to planar embeddings of a graph (Q4271303) (← links)
- A polyhedral theory on graphs (Q4308497) (← links)
- (Q4501524) (← links)
- An algorithm for an 𝓁<sup>2</sup>-homological test for the planarity of a graph (Q4956221) (← links)
- Testing Planarity of Partially Embedded Graphs (Q4962193) (← links)
- Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time (Q5014135) (← links)
- Almost-linear <i>ε</i> -emulators for planar graphs (Q6083585) (← links)