scientific article; zbMATH DE number 3047038
From MaRDI portal
Publication:5786239
Cited in
(only showing first 100 items - show all)- Constructing compact rectilinear planar layouts using canonical representation of planar graphs
- Polynomial algorithms for open plane graph and subgraph isomorphisms
- Simultaneous graph embedding with bends and circular arcs
- Drawing plane graphs nicely
- Straight-line rectangular drawings of clustered graphs
- Geometric biplane graphs. I: Maximal graphs
- Towards a Characterization of Stretchable Aligned Graphs
- An extension of a fixed point problem for simple graphs
- On the area-universality of triangulations
- The complexity of drawing a graph in a polygonal region
- On the red/blue spanning tree problem
- Topological queries in spatial databases
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
- On the crossing number for Kronecker product of a tripartite graph with path
- Representing orders on the plane by translating convex figures
- Acute triangles in triangulations on the plane with minimum degree at least 4
- Orienting planar graphs
- Total domination in plane triangulations
- Schnyder woods, \(\mathrm{SLE}_{16}\), and Liouville quantum gravity
- Untangling polygons and graphs
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- Nonabelian flows in networks
- Minimal Delaunay triangulations of hyperbolic surfaces
- Fundamentals of planar ordered sets
- Universal point sets for planar three-trees
- Drawings of planar graphs with few slopes and segments
- A polynomial bound for untangling geometric planar graphs
- Grid embedding of 4-connected plane graphs
- Representing a planar graph by vertical lines joining different levels
- Minimum-width grid drawings of plane graphs
- An annotated review on graph drawing and its applications
- Variations on a theme of Kasteleyn, with application to the totally nonnegative Grassmannian
- Orthogonal tree decompositions of graphs
- Establishing order in planar subdivisions
- Approximating the rectilinear crossing number
- Upward planar morphs
- Triangulability of convex graphs and convex skewness
- Feature-based 3D morphing based on geometrically constrained spherical parameterization
- scientific article; zbMATH DE number 90553 (Why is no real title available?)
- Re-embedding a 1-plane graph for a straight-line drawing in linear time
- Convex drawings of hierarchical planar graphs and clustered planar graphs
- Planar graphs and poset dimension
- Maximum nullity and zero forcing number on graphs with maximum degree at most three
- Planarity and duality of finite and infinite graphs
- A variational principle for circle packings.
- Inclusion-exclusion complexes for pseudodisk collections
- Non-convex Representations of Graphs
- A network flow approach to a common generalization of Clar and Fries numbers
- Polyline Drawings with Topological Constraints
- An exponential bound for simultaneous embeddings of planar graphs
- On the Pseudolinear Crossing Number
- A linear-time algorithm for testing full outer-2-planarity
- Geometric achromatic and pseudoachromatic indices
- Straight-line representations of maps on the torus and other flat surfaces
- Embedding Graphs into Embedded Graphs
- Planar minimally rigid graphs and pseudo-triangulations
- Triangulations without minimum-weight drawing
- On embedding an outer-planar graph in a point set
- How to draw a planar graph on a grid
- On edge-length ratios of partial 2-trees
- Geometric graphs which are 1-skeletons of unstacked triangulated polygons
- Characterizing proximity trees
- A successful concept for measuring non-planarity of graphs: The crossing number.
- Free edge lengths in plane graphs
- Barycentric systems and stretchability
- Polytopes, graphs, and complexes
- One-to-one piecewise linear mappings over triangulations
- Straight-line drawings of 1-planar graphs
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
- Experimental results on quadrangulations of sets of fixed points
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints
- Geometric biplane graphs. II: Graph augmentation
- Coloring non-crossing strings
- Parametrization and smooth approximation of surface triangulations
- A linear-time algorithm for drawing a planar graph on a grid
- A note on visibility graphs
- Stationary straight-line representations of stationary random graphs
- Approximating the rectilinear crossing number
- Automatische Abbildung eines planaren Graphen in einen ebenen Streckengraphen
- Pointed drawings of planar graphs
- Green's theorem and isolation in planar graphs
- Pole dancing: 3D morphs for tree drawings
- Upward point set embeddings of paths and trees
- Which crossing number is it anyway?
- Checking the convexity of polytopes and the planarity of subdivisions (extended abstract)
- Ramsey Theorems for Knots, Links and Spatial Graphs
- Cycle double covers of infinite planar graphs
- Polyhedral suspensions of arbitrary genus
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Simultaneous embedding of colored graphs
- Drawing planar graphs with circular arcs
- Outerplanar graph drawings with few slopes
- Untangling a planar graph
- Beyond planar graphs: introduction
- On the number of acute triangles in a straight-line embedding of a maximal planar graph
- A logarithmic bound for simultaneous embeddings of planar graphs
- Area requirement and symmetry display of planar upward drawings
- A characterization of complete bipartite RAC graphs
- Algorithms for 1-Planar Graphs
- On flat submaps of maps of nonpositive curvature
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5786239)