Publication:5786239
From MaRDI portal
zbMath0030.17902MaRDI QIDQ5786239
Publication date: 1948
05Cxx: Graph theory
Related Items
One-to-one piecewise linear mappings over triangulations, Four-Connected Spanning Subgraphs of Doughnut Graphs, Polytopes, graphs, and complexes, Every planar graph with nine points has a nonplanar complement, [https://portal.mardi4nfdi.de/wiki/Software:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions], Drawing planar graphs with circular arcs, Ramsey Theorems for Knots, Links and Spatial Graphs, A linear-time algorithm for drawing a planar graph on a grid, An extension of a fixed point problem for simple graphs, Drawing plane graphs nicely, How to draw a planar graph on a grid, Acute triangulations of the regular dodecahedral surface, Barycentric systems and stretchability, Connectivity of plane triangulations, Convex drawings of graphs with non-convex boundary constraints, Simultaneous graph embedding with bends and circular arcs, Geometric graphs which are 1-skeletons of unstacked triangulated polygons, Drawing slicing graphs with face areas, 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, Acute triangles in 4-connected maximal plane graphs, Planar minimally rigid graphs and pseudo-triangulations, 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, Drawings of planar graphs with few slopes and segments, 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, Unnamed Item, Towards an implementation of the 3D visibility skeleton, Cubic Graphs Have Bounded Slope Parameter, Non-convex Representations of Graphs, Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three, Unnamed Item
