Pages that link to "Item:Q4962193"
From MaRDI portal
The following pages link to Testing Planarity of Partially Embedded Graphs (Q4962193):
Displaying 35 items.
- Testing outerplanarity of bounded degree graphs (Q494925) (← links)
- Minimal obstructions for partial representations of interval graphs (Q668026) (← links)
- The complexity of drawing a graph in a polygonal region (Q1725774) (← links)
- A Kuratowski-type theorem for planarity of partially embedded graphs (Q1940706) (← links)
- Simultaneous FPQ-ordering and hybrid planarity testing (Q2034412) (← links)
- Orthogonal planarity testing of bounded treewidth graphs (Q2071827) (← links)
- One-bend drawings of outerplanar graphs inside simple polygons (Q2151442) (← links)
- Extending simple drawings (Q2206853) (← links)
- The QuaSEFE problem (Q2206856) (← links)
- An SPQR-tree-like embedding representation for upward planarity (Q2206883) (← links)
- Advancements on SEFE and partitioned book embedding problems (Q2339452) (← links)
- Free edge lengths in plane graphs (Q2354683) (← links)
- Extending partial representations of interval graphs (Q2408095) (← links)
- A Planarity Test via Construction Sequences (Q2849960) (← links)
- (Q3338271) (← links)
- An algorithm for an 𝓁<sup>2</sup>-homological test for the planarity of a graph (Q4956221) (← links)
- Beyond Clustered Planar Graphs (Q5001664) (← links)
- Simultaneous Embedding (Q5001665) (← links)
- Extending Partial Orthogonal Drawings (Q5014122) (← links)
- The Complexity of Drawing a Graph in a Polygonal Region (Q5050006) (← links)
- Extending Partial Orthogonal Drawings (Q5084696) (← links)
- (Q5089197) (← links)
- Approximation Algorithms for Facial Cycles in Planar Embeddings (Q5091033) (← links)
- Embedding graphs into two-dimensional simplicial complexes (Q5115795) (← links)
- Advances on Testing C-Planarity of Embedded Flat Clustered Graphs (Q5384459) (← links)
- Multilevel Planarity (Q5856666) (← links)
- Embedding graphs into two-dimensional simplicial complexes (Q5881549) (← links)
- Extending upward planar graph drawings (Q5896867) (← links)
- Drawing Partially Embedded and Simultaneously Planar Graphs (Q5899628) (← links)
- Hierarchical partial planarity (Q5915789) (← links)
- Inserting one edge into a simple drawing is hard (Q5925627) (← links)
- (Q6065397) (← links)
- Partial and simultaneous transitive orientations via modular decompositions (Q6130330) (← links)
- Planarizing graphs and their drawings by vertex splitting (Q6172199) (← links)
- Extending partial representations of circle graphs in near-linear time (Q6582371) (← links)