scientific article

Publication date: 1984

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

representation of planar graphs convex representations of infinite finite-valent graphs

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (52)

Interval representations of planar graphs ⋮ Visibility representations of boxes in 2.5 dimensions ⋮ On orthogonally convex drawings of plane graphs ⋮ A unified approach to visibility representations of planar graphs ⋮ A note on visibility graphs ⋮ Drawings of planar graphs with few slopes and segments ⋮ Aspect ratio universal rectangular layouts ⋮ Deformations of plane graphs ⋮ Obstructions for embedding cubic graphs on the spindle surface ⋮ An annotated bibliography on 1-planarity ⋮ Algorithms for plane representations of acyclic digraphs ⋮ Special graph representation and visualization of semantic networks ⋮ Rectangular grid drawings of plane graphs ⋮ The segment number: algorithms and universal lower bounds for some classes of planar graphs ⋮ Dushnik-Miller dimension of contact systems of \(d\)-dimensional boxes ⋮ Unit-length rectangular drawings of graphs ⋮ A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners ⋮ Optimal polygonal representation of planar graphs ⋮ On-line convex planarity testing ⋮ How to build a brick ⋮ Colored anchored visibility representations in 2D and 3D space ⋮ Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints ⋮ Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra ⋮ 3D Visibility Representations of 1-planar Graphs ⋮ Bend-minimum orthogonal drawings in quadratic time ⋮ A variational principle for circle packings. ⋮ Convex drawings of graphs with non-convex boundary constraints ⋮ Infinite connected graphs with no end-preserving spanning trees ⋮ Embedding-preserving rectangle visibility representations of nonplanar graphs ⋮ Some results on visibility graphs ⋮ Rectangular grid drawings of plane graphs ⋮ How to Morph Planar Graph Drawings ⋮ A note on rectilinear and polar visibility graphs ⋮ Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds ⋮ Convex drawings of hierarchical planar graphs and clustered planar graphs ⋮ Rectangular-radial drawings of cubic plane graphs ⋮ Spherical-Rectangular Drawings ⋮ Ortho-polygon visibility representations of embedded graphs ⋮ Convexity-increasing morphs of planar graphs ⋮ Rectangular drawings of plane graphs without designated corners ⋮ Non-convex Representations of Graphs ⋮ A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs ⋮ Octagonal drawings of plane graphs with prescribed face areas ⋮ Drawing slicing graphs with face areas ⋮ Fixed edge-length graph drawing is NP-hard ⋮ Planar acyclic oriented graphs ⋮ On 3D visibility representations of graphs with few crossings per edge ⋮ An algorithm for constructing star-shaped drawings of plane graphs ⋮ Homothetic triangle representations of planar graphs ⋮ Edge Partitions and Visibility Representations of 1-planar Graphs ⋮ Incremental convex planarity testing ⋮ Convex representations of maps on the torus and other flat surfaces

This page was built for publication: