𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for testing the planarity of a hierarchical graph

✍ Scribed by Toshinobu Kashiwabara; Sumio Masuda

Book ID
112079474
Publisher
John Wiley and Sons
Year
1992
Tongue
English
Weight
1004 KB
Volume
75
Category
Article
ISSN
1042-0967

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A criterion for the planarity of a graph
A criterion for the planarity of a graph
✍ Jerome R. Breitenbach πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 146 KB πŸ‘ 1 views

In a recent paper, Carsten Thomassen [Carsten Thomassen, Planarity and duality of finite and infinite graphs. J. Combinatorial Theory Ser. B 29 (1980) 244-2711 has shown that a number of criteria for the planarity of a graph can be reduced to that of Kuratowski. Here we present another criterion whi

An algorithm for straight-line represent
An algorithm for straight-line representation of simple planar graphs
✍ Lin Woo πŸ“‚ Article πŸ“… 1969 πŸ› Elsevier Science 🌐 English βš– 841 KB

An algorithm is developed for drawing straight-line planar graphs which are isomorphic to a convex polyhedron and simple (i.e. a connected graph with no self-loops or multiple branches). The construction of such graphs is outlined in three stages. Stage 1 determines all the independent cycles of the