scientific article; zbMATH DE number 3047038

Cited in

(only showing first 100 items - show all)

Drawing slicing graphs with face areas
An algorithm for constructing star-shaped drawings of plane graphs
A polynomial bound for untangling geometric planar graphs
Untangling a planar graph
Representing a planar graph by vertical lines joining different levels
Rectilinear planar layouts and bipolar orientations of planar graphs
Fundamentals of planar ordered sets
A note on visibility graphs
Representing orders on the plane by translating convex figures
Establishing order in planar subdivisions
Planar graphs and poset dimension
Algorithms for plane representations of acyclic digraphs
Planarity and duality of finite and infinite graphs
A variational principle for circle packings.
Area requirement and symmetry display of planar upward drawings
Constructing compact rectilinear planar layouts using canonical representation of planar graphs
Drawing the planar dual
Fast detection and display of symmetry in outerplanar graphs
Orienting planar graphs
Minimum-width grid drawings of plane graphs
Checking the convexity of polytopes and the planarity of subdivisions
Topological queries in spatial databases
On the number of acute triangles in a straight-line embedding of a maximal planar graph
Inclusion-exclusion complexes for pseudodisk collections
Grid embedding of 4-connected plane graphs
Characterizing and efficiently computing quadrangulations of planar point sets
Parametrization and smooth approximation of surface triangulations
Tutte's barycenter method applied to isotopies
Geometric thickness in a grid
A successful concept for measuring non-planarity of graphs: The crossing number.
Experimental results on quadrangulations of sets of fixed points
Shortest path embeddings of graphs on surfaces
On the area-universality of triangulations
The complexity of drawing a graph in a polygonal region
A linear-time algorithm for testing full outer-2-planarity
Acute triangles in 4-connected maximal plane graphs
Planar minimally rigid graphs and pseudo-triangulations
Closest paths in graph drawings under an elastic metric
An algebraic approach to the planar coloring problem
Using triangles to partition a disk
Which crossing number is it anyway?
Incremental convex planarity testing
On embedding an outer-planar graph in a point set
Planarity-preserving clustering and embedding for large planar graphs
Stationary straight-line representations of stationary random graphs
On a straight-line embedding problem of graphs
Characterizing proximity trees
Straight-line representations of maps on the torus and other flat surfaces
The non-planarity of \(K_{5}\) and \(K_{3,3}\) as axioms for plane ordered geometry
Data-driven graph drawing techniques with applications for conveyor systems
On plane drawings of 2-planar graphs
Simultaneous embedding of colored graphs
Grid straight-line embeddings of trees with a minimum number of bends per path
Convex grid drawings of planar graphs with constant edge-vertex resolution
Embedding graphs into embedded graphs
On the edge-length ratio of planar graphs
Homotopy height, grid-major height and graph-drawing height
Total domination in plane triangulations
Upward point set embeddings of paths and trees
Re-embedding a 1-plane graph for a straight-line drawing in linear time
Universal point sets for planar three-trees
Polyline drawings with topological constraints
Combinatorial characterization of upward planarity
Approximating the rectilinear crossing number
Geometric biplane graphs. I: Maximal graphs
Geometric biplane graphs. II: Graph augmentation
Free edge lengths in plane graphs
On orthogonally convex drawings of plane graphs
Drawings of planar graphs with few slopes and segments
Grid representations and the chromatic number
Optimal point-set embedding of wheel graphs and a sub-class of 3-trees
On finding convex cuts in general, bipartite and plane graphs
Skyscraper polytopes and realizations of plane triangulations
On the recognition of fan-planar and maximal outer-fan-planar graphs
Outerplanar graph drawings with few slopes
Coloring \(d\)-embeddable \(k\)-uniform hypergraphs
An algorithm for straight-line representation of simple planar graphs
Polyhedral realization in \(R^ 3\) of triangulations of the torus and 2- manifolds in cyclic 4-polytopes
Automatische Abbildung eines planaren Graphen in einen ebenen Streckengraphen
F-planar graphs
Acute triangles in triangulations on the plane with minimum degree at least 4
Minimal Delaunay triangulations of hyperbolic surfaces
scientific article; zbMATH DE number 1629854 (Why is no real title available?)
Variations on a theme of Kasteleyn, with application to the totally nonnegative Grassmannian
Geometric achromatic and pseudoachromatic indices
Triangulations without minimum-weight drawing
Approximating the rectilinear crossing number
On the Pseudolinear Crossing Number
Constructions of families of three-dimensional polytopes, characteristic patches of fullerenes, and Pogorelov polytopes
Straight-Line Rectangular Drawings of Clustered Graphs
Ising model observables and non-backtracking walks
Monotone Crossing Number
Upper Bound Constructions for Untangling Planar Geometric Graphs
The planar slope number of planar partial 3-trees of bounded degree
Cubic Graphs Have Bounded Slope Parameter
Non-convex Representations of Graphs
Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three
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

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)