✦ LIBER ✦

F-Planar graphs

✍ Scribed by Andrew Adler

Book ID: 103501273
Publisher: Elsevier Science
Year: 1973
Tongue: English
Weight: 187 KB
Volume: 15
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(73)90023-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Drawing Planar Graphs Symmetrically, II:

Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs

✍ Seok-Hee Hong; Peter Eades 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 668 KB

Drawing Planar Graphs Symmetrically, III

Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs

✍ Seok-Hee Hong; Peter Eades 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 363 KB

Planar lattices and planar graphs

✍ C.R Platt 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 487 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

Panelling planar graphs

✍ James Oxley; Don Row 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 1016 KB

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.