Embedding planar graphs at fixed vertex locations
From MaRDI portal
Recommendations
Cited in
(80)- Untangling a planar graph
- Establishing order in planar subdivisions
- Arc diagrams, flip distances, and Hamiltonian triangulations
- -stars or on extending a drawing of a connected subgraph
- On embedding an outer-planar graph in a point set
- Disk embeddings of planar graphs
- The paths embedding of the arrangement graphs with prescribed vertices in given position
- A center transversal theorem for hyperplanes and applications to graph drawing
- On upward point set embeddability
- Simultaneous embedding of colored graphs
- On inversion-free mapping and distortion minimization
- A new algorithm for embedding plane graphs at fixed vertex locations
- One-bend drawings of outerplanar graphs inside simple polygons
- On compatible triangulations with a minimum number of Steiner points
- Colored anchored visibility representations in 2D and 3D space
- The QuaSEFE problem
- On the curve complexity of 3-colored point-set embeddings
- Computing upward topological book embeddings of upward planar digraphs
- Advancements on SEFE and partitioned book embedding problems
- Optimal point-set embedding of wheel graphs and a sub-class of 3-trees
- scientific article; zbMATH DE number 1696626 (Why is no real title available?)
- Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations
- The point-set embeddability problem for plane graphs
- Improved algorithms for the point-set embeddability problem for plane 3-trees
- Drawing planar graphs on points inside a polygon
- Simultaneous embeddings with vertices mapping to pre-specified points
- Constrained point-set embeddability of planar graphs
- On minimizing the number of label transitions around a vertex of a planar graph
- Minimizing the number of label transitions around a nonseparating vertex of a planar graph
- Embedding plane 3-trees in \(\mathbb R^{2}\) and \(\mathbb R^{3}\)
- Upward point set embeddability for convex point sets is in P
- Extending convex partial drawings of graphs
- Alternating paths and cycles of minimum length
- On embedding triconnected cubic graphs on point sets
- Embeddability Problems for Upward Planar Digraphs
- Constrained Point-Set Embeddability of Planar Graphs
- Point-set embeddings of plane 3-trees
- scientific article; zbMATH DE number 1500681 (Why is no real title available?)
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- Relating graph thickness to planar layers and bend complexity
- Recognizing weak embeddings of graphs
- Colored Point-Set Embeddings of Acyclic Graphs
- Common-Face Embeddings of Planar Graphs
- Quasi-planar Graphs
- Right Angle Crossing Drawings of Graphs
- Simultaneous Embedding
- Extending Partial Orthogonal Drawings
- Extending partial orthogonal drawings
- Circumscribing polygons and polygonizations for disjoint line segments
- scientific article; zbMATH DE number 7559402 (Why is no real title available?)
- Simultaneous embeddings with few bends and crossings
- Plane 3-trees: embeddability and approximation
- Constrained point set embedding of a balanced binary tree
- A Census of Plane Graphs with Polyline Edges
- Planar Embeddings of Graphs with Specified Edge Lengths
- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
- ON EMBEDDING A GRAPH ON TWO SETS OF POINTS
- DRAWING WITH FAT EDGES
- 2-colored point-set embeddings of partial 2-trees
- 2-colored point-set embeddings of partial 2-trees
- Drawing Simultaneously Embedded Graphs with Few Bends
- Small Point-Sets Supporting Graph Stories
- Small point-sets supporting graph stories
- Treewidth, Circle Graphs, and Circular Drawings
- On graph thickness, geometric thickness, and separator theorems
- Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
- On 1-bend upward point-set embeddings of \(st\)-digraphs
- A linear-time approximation algorithm for the minimum-length geometric embedding of trees
- On the complexity of simultaneous geometric embedding for edge-disjoint graphs
- Curve-constrained drawings of planar graphs
- Dynamic parameterized problems on unit disk graphs
- Tangling and untangling trees on point-sets
- Planar straight-line point-set embedding of trees with partial embeddings
- On triconnected and cubic plane graphs on given point sets
- Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
- Point-set embeddings of trees with given partial drawings
- Radial drawings of graphs: geometric constraints and trade-offs
- Simultaneous graph embedding with bends and circular arcs
- Drawing colored graphs on colored points
- Drawing colored graphs with constrained vertex positions and few bends per edge
This page was built for publication: Embedding planar graphs at fixed vertex locations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5956107)
