Embedding planar graphs at fixed vertex locations
From MaRDI portal
Publication:5956107
DOI10.1007/PL00007258zbMath0991.05036WikidataQ56853081 ScholiaQ56853081MaRDI QIDQ5956107
Publication date: 28 August 2002
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)
Related Items (61)
A new algorithm for embedding plane graphs at fixed vertex locations ⋮ On triconnected and cubic plane graphs on given point sets ⋮ IMPROVED ALGORITHMS FOR THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE 3-TREES ⋮ Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices ⋮ Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges ⋮ One-bend drawings of outerplanar graphs inside simple polygons ⋮ Extending convex partial drawings of graphs ⋮ Relating Graph Thickness to Planar Layers and Bend Complexity ⋮ Alternating paths and cycles of minimum length ⋮ Optimal point-set embedding of wheel graphs and a sub-class of 3-trees ⋮ Extending Partial Orthogonal Drawings ⋮ Embedding Plane 3-Trees in ℝ2 and ℝ3 ⋮ Upward Point Set Embeddability for Convex Point Sets Is in P ⋮ On embedding triconnected cubic graphs on point sets ⋮ On graph thickness, geometric thickness, and separator theorems ⋮ On compatible triangulations with a minimum number of Steiner points ⋮ Small Point-Sets Supporting Graph Stories ⋮ A center transversal theorem for hyperplanes and applications to graph drawing ⋮ Small point-sets supporting graph stories ⋮ Arc diagrams, flip distances, and Hamiltonian triangulations ⋮ Treewidth, Circle Graphs, and Circular Drawings ⋮ Point-set embeddings of plane \(3\)-trees ⋮ Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges ⋮ On upward point set embeddability ⋮ Colored anchored visibility representations in 2D and 3D space ⋮ The QuaSEFE problem ⋮ On the curve complexity of 3-colored point-set embeddings ⋮ Point-set embeddings of trees with given partial drawings ⋮ Colored Point-Set Embeddings of Acyclic Graphs ⋮ \(\beta\)-stars or on extending a drawing of a connected subgraph ⋮ Radial drawings of graphs: geometric constraints and trade-offs ⋮ Simultaneous graph embedding with bends and circular arcs ⋮ Drawing colored graphs on colored points ⋮ Computing upward topological book embeddings of upward planar digraphs ⋮ Simultaneous Embeddings with Few Bends and Crossings ⋮ Drawing colored graphs with constrained vertex positions and few bends per edge ⋮ Curve-constrained drawings of planar graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS ⋮ Embeddability Problems for Upward Planar Digraphs ⋮ Constrained Point-Set Embeddability of Planar Graphs ⋮ Drawing Simultaneously Embedded Graphs with Few Bends ⋮ Simultaneous embedding of colored graphs ⋮ 2-colored point-set embeddings of partial 2-trees ⋮ On inversion-free mapping and distortion minimization ⋮ 2-colored point-set embeddings of partial 2-trees ⋮ Planar straight-line point-set embedding of trees with partial embeddings ⋮ ON EMBEDDING A GRAPH ON TWO SETS OF POINTS ⋮ DRAWING WITH FAT EDGES ⋮ Untangling a planar graph ⋮ Planar drawings of fixed-mobile bigraphs ⋮ Quasi-planar Graphs ⋮ Right Angle Crossing Drawings of Graphs ⋮ Simultaneous Embedding ⋮ A Census of Plane Graphs with Polyline Edges ⋮ Plane 3-Trees: Embeddability and Approximation ⋮ Advancements on SEFE and partitioned book embedding problems ⋮ Extending Partial Orthogonal Drawings ⋮ Constrained Point Set Embedding of a Balanced Binary Tree ⋮ THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS
This page was built for publication: Embedding planar graphs at fixed vertex locations
