scientific article
From MaRDI portal
Publication:3220608
zbMath0556.05023MaRDI QIDQ3220608
Norishige Chiba, Tadashi Yamanouchi, Takao Nishizeki
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Planar graphs; geometric and topological aspects of graph theory (05C10) Polytopes and polyhedra (52Bxx)
Related Items
A linear algorithm for embedding planar graphs using PQ-trees, Rectilinear planar layouts and bipolar orientations of planar graphs, A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs, Straight-Line Drawability of a Planar Graph Plus an Edge, Minimum-segment convex drawings of 3-connected cubic plane graphs, Grid embedding of 4-connected plane graphs, On RAC drawings of 1-planar graphs, The Stub Resolution of 1-planar Graphs, Algorithms for plane representations of acyclic digraphs, New results on drawing angle graphs, On morphing 1-planar drawings, Straight-line drawings of 1-planar graphs, A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners, On-line convex planarity testing, 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, Representations of graphs and networks (coding, layouts and embeddings), A linear-time algorithm for drawing a planar graph on a grid, Convex drawings of graphs with non-convex boundary constraints, Strip planarity testing for embedded planar graphs, Unnamed Item, How to Morph Planar Graph Drawings, Convex drawings of hierarchical planar graphs and clustered planar graphs, Triangulating planar graphs while minimizing the maximum degree, Compact drawings of 1-planar graphs with right-angle crossings and few bends, Non-convex Representations of Graphs, A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs, Minimum-width grid drawings of plane graphs, A note on isosceles planar graph drawing, An algorithm for constructing star-shaped drawings of plane graphs, Algorithms for 1-Planar Graphs, Drawing plane graphs nicely, Incremental convex planarity testing, Convex representations of maps on the torus and other flat surfaces
