Testing Planarity of Partially Embedded Graphs
From MaRDI portal
Recommendations
- Testing planarity of partially embedded graphs
- Strip planarity testing for embedded planar graphs
- On the linearity of testing planarity of graphs
- Upward planarity testing of embedded mixed graphs
- scientific article; zbMATH DE number 4049078
- A new approach to the linearity of testing planarity of graphs
- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
- Testing mutual duality of planar graphs
- Testing Mutual Duality of Planar Graphs
- Upward and quasi-upward planarity testing of embedded mixed graphs
Cited in
(51)- The complexity of drawing a graph in a polygonal region
- A Kuratowski-type theorem for planarity of partially embedded graphs
- Orthogonal planarity testing of bounded treewidth graphs
- One-bend drawings of outerplanar graphs inside simple polygons
- Extending simple drawings
- The QuaSEFE problem
- An SPQR-tree-like embedding representation for upward planarity
- Advancements on SEFE and partitioned book embedding problems
- Free edge lengths in plane graphs
- A Planarity Test via Construction Sequences
- Testing Mutual Duality of Planar Graphs
- scientific article; zbMATH DE number 3871391 (Why is no real title available?)
- Testing outerplanarity of bounded degree graphs
- An algorithm for an 𝓁2-homological test for the planarity of a graph
- Beyond Clustered Planar Graphs
- Simultaneous Embedding
- Extending Partial Orthogonal Drawings
- The complexity of drawing a graph in a polygonal region
- Extending partial orthogonal drawings
- scientific article; zbMATH DE number 7559402 (Why is no real title available?)
- Approximation Algorithms for Facial Cycles in Planar Embeddings
- Embedding graphs into two-dimensional simplicial complexes
- Advances on testing C-planarity of embedded flat clustered graphs
- A Kuratowski-type theorem for planarity of partially embedded graphs
- Testing planarity of partially embedded graphs
- Multilevel planarity
- scientific article; zbMATH DE number 7662167 (Why is no real title available?)
- Drawing partially embedded and simultaneously planar graphs
- Drawing partially embedded and simultaneously planar graphs
- Inserting one edge into a simple drawing is hard
- Extending partial representations of circular-arc graphs
- scientific article; zbMATH DE number 7765366 (Why is no real title available?)
- Partial and simultaneous transitive orientations via modular decompositions
- An annotated review on graph drawing and its applications
- Planarizing graphs and their drawings by vertex splitting
- Extending partial representations of circle graphs in near-linear time
- Minimal obstructions for partial representations of interval graphs
- Extending partial 1-planar drawings
- On k-plane insertion into plane drawings
- The parameterized complexity of extending stack layouts
- Partial and constrained level planarity
- Ranking and unranking of the planar embeddings of a planar graph
- Constrained planarity in practice -- engineering the synchronized planarity algorithm
- Polygon-universal graphs
- An FPT algorithm for the embeddability of graphs into two-dimensional simplicial complexes
- Crossing-optimal extension of simple drawings
- Dynamic embeddings of dynamic single-source upward planar graphs
- The peculiarities of extending queue layouts
- The complexity of extending fair allocations of indivisible goods
- The parameterized complexity of extending stack layouts
- Structural parameterizations of simultaneous planarity
This page was built for publication: Testing Planarity of Partially Embedded Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4962193)
