๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Panelling planar graphs

โœ Scribed by James Oxley; Don Row


Book ID
104294828
Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
1016 KB
Volume
81
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

โœฆ Synopsis


The skeleton of a spherical polyhedron may also be viewed as the skeleton of other panelled structures. We characterize those collections of cycles of a planar graph that bound the panels of hinged-panel structures, and distinguish those that arise from spherical polyhedra.


๐Ÿ“œ SIMILAR VOLUMES


Planar lattices and planar graphs
โœ C.R Platt ๐Ÿ“‚ Article ๐Ÿ“… 1976 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 487 KB
F-Planar graphs
โœ Andrew Adler ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 187 KB
Planar domination graphs
โœ Elaine M. Eschen; William F. Klostermeyer; R. Sritharan ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 126 KB
Randomly planar graphs
โœ Daniel C. Isaksen; David P. Moulton ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 189 KB

A graph G is randomly planar if every planar embedding of every connected subgraph of G can be extended to a planar embedding of G. We classify these graphs. ## 1. Introduction Many properties of graphs have been 'randomized' by various mathematicians. Examples include the notions of randomly eule