Pages that link to "Item:Q1049731"
From MaRDI portal
The following pages link to An algorithm of graph planarity testing and cross minimization (Q1049731):
Displaying 7 items.
- On the linearity of testing planarity of graphs (Q1095918) (← links)
- A new approach to the linearity of testing planarity of graphs (Q1117237) (← links)
- Orthogonal planarity testing of bounded treewidth graphs (Q2071827) (← links)
- (Q3205253) (← links)
- (Q3338271) (← links)
- An algorithm for an 𝓁<sup>2</sup>-homological test for the planarity of a graph (Q4956221) (← links)
- A linear time algorithm for finding maximal planar subgraphs (Q6487983) (← links)