scientific article; zbMATH DE number 3047038
From MaRDI portal
Publication:5786239
zbMath0030.17902MaRDI QIDQ5786239
Publication date: 1948
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On orthogonally convex drawings of plane graphs ⋮ One-to-one piecewise linear mappings over triangulations ⋮ The Complexity of Drawing a Graph in a Polygonal Region ⋮ Straight-Line Rectangular Drawings of Clustered Graphs ⋮ Drawings of planar graphs with few slopes and segments ⋮ Ising model observables and non-backtracking walks ⋮ Relating Graph Thickness to Planar Layers and Bend Complexity ⋮ Unnamed Item ⋮ Grid representations and the chromatic number ⋮ On Edge-Length Ratios of Partial 2-Trees ⋮ Optimal point-set embedding of wheel graphs and a sub-class of 3-trees ⋮ Polytopes, graphs, and complexes ⋮ On finding convex cuts in general, bipartite and plane graphs ⋮ Triangulability of convex graphs and convex skewness ⋮ Skyscraper polytopes and realizations of plane triangulations ⋮ On the recognition of fan-planar and maximal outer-fan-planar graphs ⋮ Reviews ⋮ Checking the convexity of polytopes and the planarity of subdivisions (extended abstract) ⋮ Monotone Crossing Number ⋮ Upper Bound Constructions for Untangling Planar Geometric Graphs ⋮ Nonabelian flows in networks ⋮ Straight-line drawings of 1-planar graphs ⋮ An exponential bound for simultaneous embeddings of planar graphs ⋮ The computational complexity of knot genus in a fixed 3‐manifold ⋮ Embedding dimensions of simplicial complexes on few vertices ⋮ Strictly-convex drawings of 3-connected planar graphs ⋮ Relating planar graph drawings to planar satisfiability problems ⋮ An annotated review on graph drawing and its applications ⋮ Approximating the Rectilinear Crossing Number ⋮ On-line convex planarity testing ⋮ Minimal Delaunay triangulations of hyperbolic surfaces ⋮ On the Pseudolinear Crossing Number ⋮ Outerplanar graph drawings with few slopes ⋮ Nerves, minors, and piercing numbers ⋮ Obstacle Numbers of Planar Graphs ⋮ On flat submaps of maps of nonpositive curvature ⋮ Orthogonal Tree Decompositions of Graphs ⋮ Every planar graph with nine points has a nonplanar complement ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions] ⋮ Universal point sets for planar three-trees ⋮ Untangling polygons and graphs ⋮ Drawing planar graphs with circular arcs ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ Towards an implementation of the 3D visibility skeleton ⋮ Upward planar morphs ⋮ Cubic Graphs Have Bounded Slope Parameter ⋮ Non-convex Representations of Graphs ⋮ Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three ⋮ Four-Connected Spanning Subgraphs of Doughnut Graphs ⋮ On the crossing number for Kronecker product of a tripartite graph with path ⋮ Coloring \(d\)-embeddable \(k\)-uniform hypergraphs ⋮ Polyline drawings with topological constraints ⋮ Unnamed Item ⋮ An algorithm for straight-line representation of simple planar graphs ⋮ Polyline Drawings with Topological Constraints ⋮ Combinatorial characterization of upward planarity ⋮ Pole Dancing: 3D Morphs for Tree Drawings ⋮ Polyhedral realization in \(R^ 3\) of triangulations of the torus and 2- manifolds in cyclic 4-polytopes ⋮ Ramsey Theorems for Knots, Links and Spatial Graphs ⋮ Automatische Abbildung eines planaren Graphen in einen ebenen Streckengraphen ⋮ F-planar graphs ⋮ Approximating the rectilinear crossing number ⋮ Beyond Planar Graphs: Introduction ⋮ Algorithms for 1-Planar Graphs ⋮ Acute triangles in triangulations on the plane with minimum degree at least 4 ⋮ Constructions of families of three-dimensional polytopes, characteristic patches of fullerenes, and Pogorelov polytopes ⋮ Towards a Characterization of Stretchable Aligned Graphs ⋮ Geometric biplane graphs. I: Maximal graphs ⋮ Geometric biplane graphs. II: Graph augmentation ⋮ Embedding Graphs into Embedded Graphs ⋮ Free edge lengths in plane graphs ⋮ Variations on a theme of Kasteleyn, with application to the totally nonnegative Grassmannian ⋮ Rectilinear planar layouts and bipolar orientations of planar graphs ⋮ Fundamentals of planar ordered sets ⋮ Geometric achromatic and pseudoachromatic indices ⋮ A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs ⋮ Triangulations without minimum-weight drawing ⋮ A note on visibility graphs ⋮ Untangling polygons and graphs ⋮ Inclusion-exclusion complexes for pseudodisk collections ⋮ Grid embedding of 4-connected plane graphs ⋮ Stationary straight-line representations of stationary random graphs ⋮ The planar slope number of planar partial 3-trees of bounded degree ⋮ Representing orders on the plane by translating convex figures ⋮ Establishing order in planar subdivisions ⋮ On a straight-line embedding problem of graphs ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ Acute triangulations of the regular dodecahedral surface ⋮ Planar graphs and poset dimension ⋮ Characterizing proximity trees ⋮ Algorithms for plane representations of acyclic digraphs ⋮ Polyhedral suspensions of arbitrary genus ⋮ 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 ⋮ Barycentric systems and stretchability ⋮ 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 ⋮ Polynomial algorithms for open plane graph and subgraph isomorphisms ⋮ Characterizing and efficiently computing quadrangulations of planar point sets ⋮ Parametrization and smooth approximation of surface triangulations ⋮ Tutte's barycenter method applied to isotopies ⋮ Shortest path embeddings of graphs on surfaces ⋮ Planarity and duality of finite and infinite graphs ⋮ Straight-line rectangular drawings of clustered graphs ⋮ Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs ⋮ Feature-based 3D morphing based on geometrically constrained spherical parameterization ⋮ Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges ⋮ Embedding graphs into embedded graphs ⋮ On the edge-length ratio of planar graphs ⋮ Homotopy height, grid-major height and graph-drawing height ⋮ Connectivity of plane triangulations ⋮ Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints ⋮ Geometric thickness in a grid ⋮ Pointed drawings of planar graphs ⋮ A successful concept for measuring non-planarity of graphs: The crossing number. ⋮ Characterization of unlabeled level planar trees ⋮ Total domination in plane triangulations ⋮ 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 ⋮ A variational principle for circle packings. ⋮ Connectivity augmentation in planar straight line graphs ⋮ Upward point set embeddings of paths and trees ⋮ Re-embedding a 1-plane graph for a straight-line drawing in linear time ⋮ Data-driven graph drawing techniques with applications for conveyor systems ⋮ A linear-time algorithm for drawing a planar graph on a grid ⋮ Area requirement and symmetry display of planar upward drawings ⋮ Computing planarity in computable planar graphs ⋮ Convex drawings of graphs with non-convex boundary constraints ⋮ Constructing compact rectilinear planar layouts using canonical representation of planar graphs ⋮ Simultaneous graph embedding with bends and circular arcs ⋮ Drawing the planar dual ⋮ Fast detection and display of symmetry in outerplanar graphs ⋮ An extension of a fixed point problem for simple graphs ⋮ On the red/blue spanning tree problem ⋮ Orienting planar graphs ⋮ Acute triangles in 4-connected maximal plane graphs ⋮ Planar minimally rigid graphs and pseudo-triangulations ⋮ Green's theorem and isolation in planar graphs ⋮ Every collinear set in a planar graph is free ⋮ Convex drawings of hierarchical planar graphs and clustered planar graphs ⋮ Closest paths in graph drawings under an elastic metric ⋮ On plane drawings of 2-planar graphs ⋮ The partial visibility representation extension problem ⋮ Cycle double covers of infinite planar graphs ⋮ Coloring non-crossing strings ⋮ Geometric graphs which are 1-skeletons of unstacked triangulated polygons ⋮ Drawing slicing graphs with face areas ⋮ An algebraic approach to the planar coloring problem ⋮ Simultaneous embedding of colored graphs ⋮ Minimum-width grid drawings of plane graphs ⋮ Using triangles to partition a disk ⋮ Grid straight-line embeddings of trees with a minimum number of bends per path ⋮ Checking the convexity of polytopes and the planarity of subdivisions ⋮ A note on isosceles planar graph drawing ⋮ A characterization of complete bipartite RAC graphs ⋮ An algorithm for constructing star-shaped drawings of plane graphs ⋮ Maximum nullity and zero forcing number on graphs with maximum degree at most three ⋮ A polynomial bound for untangling geometric planar graphs ⋮ Untangling a planar graph ⋮ Representing a planar graph by vertical lines joining different levels ⋮ Which crossing number is it anyway? ⋮ Topological queries in spatial databases ⋮ On the number of acute triangles in a straight-line embedding of a maximal planar graph ⋮ Drawing plane graphs nicely ⋮ Incremental convex planarity testing ⋮ How to draw a planar graph on a grid ⋮ On embedding an outer-planar graph in a point set ⋮ Experimental results on quadrangulations of sets of fixed points ⋮ Planarity-preserving clustering and embedding for large planar graphs
