scientific article

Publication date: 15 December 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

Drawing plane triangulations with few segments, Arboricity and bipartite subgraph listing algorithms, Outer 1-planar graphs, Lower and upper bounds for long induced paths in 3-connected planar graphs, Schnyder woods for higher genus triangulated surfaces, with applications to encoding, A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs, Bottleneck bichromatic full Steiner trees, Decidability of string graphs, Tight bounds to localize failure nodes on trees, grids and through embeddings under Boolean network tomography, Separation dimension of graphs and hypergraphs, Simultaneous visibility representations of plane $st$-graphs using L-shapes, The space complexity of sum labelling, On simultaneous straight-line grid embedding of a planar graph and its dual, Universal sets of $n$ points for one-bend drawings of planar graphs with $n$ vertices, Greedy drawings of triangulations, The strength of weak proximity, Grid embedding of 4-connected plane graphs, From Tutte to Floater and Gotsman: on the resolution of planar straight-line drawings and morphs, One-bend drawings of outerplanar graphs inside simple polygons, Limitations on realistic hyperbolic graph drawing, Triangulating planar graphs while minimizing the maximum degree, On chordal and perfect plane near-triangulations, On graphs whose eternal vertex cover number and vertex cover number coincide, Convex grid drawings of planar graphs with constant edge-vertex resolution, Efficient computation of implicit representations of sparse graphs, Drawing planar graphs using the canonical ordering, On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm, The geometry and combinatorics of discrete line segment hypergraphs, Linear-time algorithms for hole-free rectilinear proportional contact graph representations, New results on drawing angle graphs, Area-efficient planar straight-line drawings of outerplanar graphs, 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, A simple routing algorithm based on Schnyder coordinates, Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems, Acyclic coloring with few division vertices, Rectangular grid drawings of plane graphs, Bijections for Weyl chamber walks ending on an axis, using arc diagrams and Schnyder woods, Tree drawings revisited, A compact encoding of plane triangulations with efficient query supports, Improved floor-planning of graphs via adjacency-preserving transformations, Good spanning trees in graph drawing, New results on edge partitions of 1-plane graphs, 4-labelings and grid embeddings of plane quadrangulations, Small grid embeddings of 3-polytopes, Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs, Unified bijections for maps with prescribed degrees and girth, Point-set embeddings of plane $3$-trees, A local characterization for perfect plane near-triangulations, Representing graphs and hypergraphs by touching polygons in 3D, Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators, Pointed drawings of planar graphs, Straight-line drawings of outerplanar graphs in $O(dn \log n)$ area, Orthogonal drawings based on the stratification of planar graphs, Spatial reasoning with $\mathcal{RCC} 8$ and connectedness constraints in Euclidean spaces, Orthogonal surfaces and their CP-orders, The complexity of drawing a graph in a polygonal region, On succinct greedy drawings of plane triangulations and 3-connected plane graphs, Some provably hard crossing number problems, Planar orientations with low out-degree and compaction of adjacency matrices, Morphing Schnyder drawings of planar triangulations, A linear-time algorithm for drawing a planar graph on a grid, On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings, On partitioning the edges of 1-plane graphs, Area requirement and symmetry display of planar upward drawings, Schnyder woods and orthogonal surfaces, Does contraction preserve triangular meshes?, Monotone drawings of graphs with few directions, Crossing number for graphs with bounded pathwidth, Small universal point sets for $k$-outerplanar graphs, Straight line triangle representations, Geometric versions of the three-dimensional assignment problem under general norms, Drawing the planar dual, Faster approximate diameter and distance oracles in planar graphs, Small grid drawings of planar graphs with balanced partition, Adjacency posets of planar graphs, A note on optimal area algorithms for upward drawings of binary trees, Robust self-assembly of graphs, Improved visibility representation of plane graphs, Planar minimally rigid graphs and pseudo-triangulations, On the area requirements of planar greedy drawings of triconnected planar graphs, Green's theorem and isolation in planar graphs, Ortho-polygon visibility representations of embedded graphs, Intervals in Catalan lattices and realizers of triangulations, Transversal structures on triangulations: A combinatorial study and straight-line drawings, 2-connecting outerplanar graphs without blowing up the pathwidth, Open rectangle-of-influence drawings of inner triangulated plane graphs, Minimum-width grid drawings of plane graphs, Small area drawings of outerplanar graphs, Classes and recognition of curve contact graphs, A note on isosceles planar graph drawing, Advances in the theory and practice of graph drawing, Upward straight-line embeddings of directed graphs into point sets, Orientations and bijections for toroidal maps with prescribed face-degrees and essential girth, Visibility representation of plane graphs via canonical ordering tree, A mating-of-trees approach for graph distances in random planar maps, Navigating planar topologies in near-optimal space and time, Incremental convex planarity testing, Planarity-preserving clustering and embedding for large planar graphs, 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids, Bounds for the oriented diameter of planar triangulations, Strictly-convex drawings of 3-connected planar graphs, Output-sensitive reporting of disjoint paths (extended abstract), On the enumeration of plane bipolar posets and transversal structures, An annotated review on graph drawing and its applications, On the construction of planar embedding for a class of orthogonal polyhedra, Bijections for generalized Tamari intervals via orientations, On-line convex planarity testing, Two algorithms for finding rectangular duals of planar graphs, Schnyder woods and Alon-Tarsi number of planar graphs, Convex grid drawings of planar graphs with constant edge-vertex resolution, Counting coloured planar maps: differential equations, The Complexity of Drawing a Graph in a Polygonal Region, Drawing Halin-graphs with small height, Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles, Monotone Drawings of 3-Connected Plane Graphs, How to draw a series-parallel digraph, Planar polyline drawings via graph transformations, Drawing Planar Graphs on Area, Schnyder woods for higher genus triangulated surfaces (abstract), Connectivity check in 3-connected planar graphs with obstacles, Upward Straight-Line Embeddings of Directed Graphs into Point Sets, A Lower Bound on the Area Requirements of Series-Parallel Graphs, Maximum Independent Set on $$B_1$$ B 1 -VPG Graphs, Area requirement of graph drawings with few crossings per edge, Orthogeodesic point-set embedding of trees, Grid representations and the chromatic number, Vertex-edge marking score of certain triangular lattices, Grid obstacle representation of graphs, Succinct encoding of binary strings representing triangulations, Euclidean greedy drawings of trees, Drawing Planar Graphs with Few Geometric Primitives, On Point-Sets That Support Planar Graphs, Small Point Sets for Simply-Nested Planar Graphs, Straight-line drawings of 1-planar graphs, Morphing triangle contact representations of triangulations, Rectangular spiral galaxies are still hard, The computational complexity of knot genus in a fixed 3‐manifold, On the Number of α-Orientations, Non-aligned Drawings of Planar Graphs, Snapping Graph Drawings to the Grid Optimally, Drawing Graphs on Few Lines and Few Planes, Succinct representation of labeled graphs, Schnyder decompositions for regular plane graphs and application to drawing, Bijections for Baxter families and related objects, A Note on Universal Point Sets for Planar Graphs, On the edge-length ratio of planar graphs, A note on universal point sets for planar graphs, 4-connected triangulations on few lines, Drawing planar graphs with few segments on a polynomial grid, Homotopy height, grid-major height and graph-drawing height, Parameterized study of Steiner tree on unit disk graphs, Succinct strictly convex greedy drawing of 3-connected plane graphs, Computing cartograms with optimal complexity, Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges, Counting polygon triangulations is hard, Succinct Representation of Labeled Graphs, Grid drawings of graphs with constant edge-vertex resolution, Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area, On local transformations in plane geometric graphs embedded on small grids, Matching edges and faces in polygonal partitions, Listing All Plane Graphs, Grid spanners with low forwarding index for energy efficient networks, Triangulations without pointed spanning trees, Universal point sets for planar three-trees, The space complexity of sum labelling, Drawing planar graphs with circular arcs, Unnamed Item, Unnamed Item, Planar graphs, via well-orderly maps and trees, Edge partitions of optimal 2-plane and 3-plane graphs, Pentagon contact representations, Triangulating planar graphs while minimizing the maximum degree, Upward planar morphs, Compact drawings of 1-planar graphs with right-angle crossings and few bends, Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract), Upward planar morphs, Universal slope sets for upward planar drawings, Succinct Greedy Graph Drawing in the Hyperbolic Plane, Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three, A Compact Encoding of Plane Triangulations with Efficient Query Supports, Representation of Planar Hypergraphs by Contacts of Triangles, On Planar Polyline Drawings, Every Schnyder drawing is a greedy embedding, Sampling and Counting 3-Orientations of Planar Triangulations, Drawing Planar Graphs with Reduced Height, Drawing graphs as spanners, Fast and compact planar embeddings, Unnamed Item, Proportional Contact Representations of Planar Graphs, Morphing Contact Representations of Graphs, Simultaneous Visibility Representations of Plane st-graphs Using L-shapes, Triangulating Planar Graphs While Keeping the Pathwidth Small, An Algorithm to Construct Greedy Drawings of Triangulations, Communicability Angle and the Spatial Efficiency of Networks, Unnamed Item, Unnamed Item, Morphing Planar Graph Drawings with Bent Edges, A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths, Planar 3-SAT with a clause/variable cycle, Quasi-planar Graphs, Edge Partitions and Visibility Representations of 1-planar Graphs, Optimal two-sided embeddings of complete binary trees in rectangular grids, An effective crossing minimisation heuristic based on star insertion, Plane 3-Trees: Embeddability and Approximation, On a class of covering problems with variable capacities in wireless networks, Unnamed Item, A Tipping Point for the Planarity of Small and Medium Sized Graphs, Edge Partition of Toroidal Graphs into Forests in Linear Time, Free edge lengths in plane graphs