scientific article; zbMATH DE number 4006289
From MaRDI portal
Publication:3757930
zbMATH Open0621.05014MaRDI QIDQ3757930FDOQ3757930
Authors: Ronald C. Read
Publication date: 1987
Title of this publication is not available (Why is that?)
Recommendations
Cited In (21)
- Graph theory and the amateur cryptographer
- A more compact visibility representation
- Rotation systems and simple drawings in surfaces
- Optimal polygonal representation of planar graphs
- Grid embedding of 4-connected plane graphs
- Triangulating planar graphs while minimizing the maximum degree
- Establishing order in planar subdivisions
- Title not available (Why is that?)
- Construction of a topological drawing of the most planar subgraph of the non-planar graph
- Title not available (Why is that?)
- Area requirement and symmetry display of planar upward drawings
- On triangulating planar graphs under the four-connectivity constraint
- Planarity testing and constructing the topological drawing of a plane graph (DFS)
- Triangulating planar graphs while minimizing the maximum degree
- A simple criterion for nodal 3-connectivity in planar graphs
- Drawing \(c\)-planar biconnected clustered graphs
- Topological sweep of the complete graph
- An experimental comparison of four graph drawing algorithms.
- Adjacency graphs of polyhedral surfaces
- Does contraction preserve triangular meshes?
- Constructing compact rectilinear planar layouts using canonical representation of planar graphs
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 Q3757930)