scientific article; zbMATH DE number 3047038

Cited in

(only showing first 100 items - show all)

Green's theorem and isolation in planar graphs
How to draw a planar graph on a grid
Characterizing proximity trees
Experimental results on quadrangulations of sets of fixed points
A variational principle for circle packings.
Orienting planar graphs
Upper Bound Constructions for Untangling Planar Geometric Graphs
Polynomial algorithms for open plane graph and subgraph isomorphisms
One-to-one piecewise linear mappings over triangulations
Incremental convex planarity testing
Geometric achromatic and pseudoachromatic indices
A successful concept for measuring non-planarity of graphs: The crossing number.
Strictly-convex drawings of 3-connected planar graphs
Polyhedral realization in \(R^ 3\) of triangulations of the torus and 2- manifolds in cyclic 4-polytopes
Characterization of unlabeled level planar trees
A polynomial bound for untangling geometric planar graphs
Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
Convex drawings of graphs with non-convex boundary constraints
Variations on a theme of Kasteleyn, with application to the totally nonnegative Grassmannian
Geometric thickness in a grid
Feature-based 3D morphing based on geometrically constrained spherical parameterization
Drawing plane graphs nicely
Characterizing and efficiently computing quadrangulations of planar point sets
Planar minimally rigid graphs and pseudo-triangulations
On the foundations of combinatorial theory I. Theory of M�bius Functions
Embedding dimensions of simplicial complexes on few vertices
Every planar graph with nine points has a nonplanar complement
On the Pseudolinear Crossing Number
Untangling a planar graph
Cycle double covers of infinite planar graphs
Coloring \(d\)-embeddable \(k\)-uniform hypergraphs
Representing orders on the plane by translating convex figures
Ramsey Theorems for Knots, Links and Spatial Graphs
Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints
Straight-line rectangular drawings of clustered graphs
Convex drawings of hierarchical planar graphs and clustered planar graphs
The planar slope number of planar partial 3-trees of bounded degree
Area requirement and symmetry display of planar upward drawings
Checking the convexity of polytopes and the planarity of subdivisions
An algorithm for constructing star-shaped drawings of plane graphs
An extension of a fixed point problem for simple graphs
Polyhedral suspensions of arbitrary genus
Algorithms for plane representations of acyclic digraphs
Parametrization and smooth approximation of surface triangulations
Barycentric systems and stretchability
On embedding an outer-planar graph in a point set
Acute triangulations of the regular dodecahedral surface
Upward point set embeddings of paths and trees
On the edge-length ratio of planar graphs
Drawing the planar dual
Planar graphs and poset dimension
Fundamentals of planar ordered sets
Rectilinear planar layouts and bipolar orientations of planar graphs
Four-Connected Spanning Subgraphs of Doughnut Graphs
Ising model observables and non-backtracking walks
Non-convex Representations of Graphs
Which crossing number is it anyway?
Computing planarity in computable planar graphs
A note on visibility graphs
Drawings of planar graphs with few slopes and segments
Orthogonal cartograms with at most 12 corners per face
Reprint of: ``Grid representations and the chromatic number
Upward planar drawings on the standing and the rolling cylinders
Maximum nullity and zero forcing number on graphs with maximum degree at most three
Planarity and duality of finite and infinite graphs
A linear-time algorithm for drawing a planar graph on a grid
Pointed drawings of planar graphs
A linear-time algorithm for testing full outer-2-planarity
On the red/blue spanning tree problem
Minimum-width grid drawings of plane graphs
Representing a planar graph by vertical lines joining different levels
Triangulations without minimum-weight drawing
Tutte's barycenter method applied to isotopies
Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
A characterization of complete bipartite RAC graphs
Connectivity augmentation in planar straight line graphs
Untangling polygons and graphs
Straight-line representations of maps on the torus and other flat surfaces
Polytopes, graphs, and complexes
On a straight-line embedding problem of graphs
Connectivity of plane triangulations
Free edge lengths in plane graphs
Re-embedding a 1-plane graph for a straight-line drawing in linear time
An annotated review on graph drawing and its applications
The non-planarity of \(K_{5}\) and \(K_{3,3}\) as axioms for plane ordered geometry
Minimal Delaunay triangulations of hyperbolic surfaces
Automatische Abbildung eines planaren Graphen in einen ebenen Streckengraphen
Simultaneous graph embedding with bends and circular arcs
Geometric biplane graphs. II: Graph augmentation
Drawing planar graphs with circular arcs
Geometric graphs which are 1-skeletons of unstacked triangulated polygons
On-line convex planarity testing
Cubic Graphs Have Bounded Slope Parameter
Pole dancing: 3D morphs for tree drawings
Acute triangles in triangulations on the plane with minimum degree at least 4
An algebraic approach to the planar coloring problem
Inclusion-exclusion complexes for pseudodisk collections
A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
Algorithms for 1-Planar Graphs
Straight-Line Rectangular Drawings of Clustered Graphs

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)