scientific article; zbMATH DE number 3047038
From MaRDI portal
Publication:5786239
zbMATH Open0030.17902MaRDI QIDQ5786239FDOQ5786239
Authors: István Fáry 
Publication date: 1948
Title of this publication is not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Polynomial algorithms for open plane graph and subgraph isomorphisms
- Drawing plane graphs nicely
- Straight-line rectangular drawings of clustered graphs
- Towards an implementation of the 3D visibility skeleton
- On the red/blue spanning tree problem
- Representing orders on the plane by translating convex figures
- Orienting planar graphs
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- Untangling polygons and graphs
- Fundamentals of planar ordered sets
- Drawings of planar graphs with few slopes and segments
- A polynomial bound for untangling geometric planar graphs
- Minimum-width grid drawings of plane graphs
- Representing a planar graph by vertical lines joining different levels
- Variations on a theme of Kasteleyn, with application to the totally nonnegative Grassmannian
- Feature-based 3D morphing based on geometrically constrained spherical parameterization
- Convex drawings of hierarchical planar graphs and clustered planar graphs
- Planar graphs and poset dimension
- Non-convex Representations of Graphs
- Planarity and duality of finite and infinite graphs
- Maximum nullity and zero forcing number on graphs with maximum degree at most three
- A variational principle for circle packings.
- On the Pseudolinear Crossing Number
- A linear-time algorithm for testing full outer-2-planarity
- Straight-line representations of maps on the torus and other flat surfaces
- Geometric achromatic and pseudoachromatic indices
- Planar minimally rigid graphs and pseudo-triangulations
- On embedding an outer-planar graph in a point set
- Triangulations without minimum-weight drawing
- Polytopes, graphs, and complexes
- How to draw a planar graph on a grid
- Characterizing proximity trees
- One-to-one piecewise linear mappings over triangulations
- A successful concept for measuring non-planarity of graphs: The crossing number.
- Barycentric systems and stretchability
- Experimental results on quadrangulations of sets of fixed points
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints
- Parametrization and smooth approximation of surface triangulations
- A note on visibility graphs
- A linear-time algorithm for drawing a planar graph on a grid
- Ramsey Theorems for Knots, Links and Spatial Graphs
- Upward point set embeddings of paths and trees
- Which crossing number is it anyway?
- Pointed drawings of planar graphs
- Green's theorem and isolation in planar graphs
- Cycle double covers of infinite planar graphs
- Polyhedral suspensions of arbitrary genus
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Untangling a planar graph
- Area requirement and symmetry display of planar upward drawings
- A characterization of complete bipartite RAC graphs
- An algorithm for constructing star-shaped drawings of plane graphs
- Acute triangulations of the regular dodecahedral surface
- Every planar graph with nine points has a nonplanar complement
- Drawing the planar dual
- Characterization of unlabeled level planar trees
- Coloring \(d\)-embeddable \(k\)-uniform hypergraphs
- Four-Connected Spanning Subgraphs of Doughnut Graphs
- On a straight-line embedding problem of graphs
- Embedding dimensions of simplicial complexes on few vertices
- Upper Bound Constructions for Untangling Planar Geometric Graphs
- Ising model observables and non-backtracking walks
- Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
- The planar slope number of planar partial 3-trees of bounded degree
- Strictly-convex drawings of 3-connected planar graphs
- Convex drawings of graphs with non-convex boundary constraints
- Checking the convexity of polytopes and the planarity of subdivisions
- Polyhedral realization in \(R^ 3\) of triangulations of the torus and 2- manifolds in cyclic 4-polytopes
- Characterizing and efficiently computing quadrangulations of planar point sets
- Computing planarity in computable planar graphs
- Connectivity augmentation in planar straight line graphs
- Algorithms for plane representations of acyclic digraphs
- Connectivity of plane triangulations
- Incremental convex planarity testing
- On the edge-length ratio of planar graphs
- Geometric thickness in a grid
- The partial visibility representation extension problem
- Tutte's barycenter method applied to isotopies
- 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
- Simultaneous graph embedding with bends and circular arcs
- Towards a Characterization of Stretchable Aligned Graphs
- Geometric biplane graphs. I: Maximal graphs
- On the area-universality of triangulations
- The complexity of drawing a graph in a polygonal region
- An extension of a fixed point problem for simple graphs
- On the crossing number for Kronecker product of a tripartite graph with path
- Topological queries in spatial databases
- Acute triangles in triangulations on the plane with minimum degree at least 4
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
- Schnyder woods, \(\mathrm{SLE}_{16}\), and Liouville quantum gravity
- Nonabelian flows in networks
- Total domination in plane triangulations
- Minimal Delaunay triangulations of hyperbolic surfaces
- Universal point sets for planar three-trees
- An annotated review on graph drawing and its applications
- Grid embedding of 4-connected plane graphs
- Upward planar morphs
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)
