𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generating planar 4-connected graphs

✍ Scribed by David Barnette

Book ID
112885879
Publisher
The Hebrew University Magnes Press
Year
1973
Tongue
English
Weight
498 KB
Volume
14
Category
Article
ISSN
0021-2172

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Generating all 3-connected 4-regular pla
Generating all 3-connected 4-regular planar graphs from the octahedron graph
✍ H. J. Broersma; A. J. W. Duijvestijn; F. GΓΆbel πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 384 KB πŸ‘ 1 views

## Abstract We prove that all 3‐connected 4‐regular planar graphs can be generated from the Octahedron Graph, using three operations. We generated these graphs up to 15 vertices inclusive. Moreover, by including a fourth operation we obtain an alternative to a procedure by Lehel to generate all con

Edge-reconstruction of 4-connected plana
Edge-reconstruction of 4-connected planar graphs
✍ S. Fiorini; J. Lauri πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 482 KB πŸ‘ 2 views

## Abstract The object of this paper is to show that 4‐connected planar graphs are uniquely determined from their collection of edge‐deleted subgraphs.

On generating planar graphs
On generating planar graphs
✍ David Barnette πŸ“‚ Article πŸ“… 1974 πŸ› Elsevier Science 🌐 English βš– 699 KB

A 3-valent graph G 1s cyclically n-connected provided one must cut at least n edges in ori4r to separate any two circuits of 6. If G is cyclically n-connected but any separation of G by cutting n edges yields a component consisting of a simple circuit, then we say that G is ' strong& cyclicaZZy n-co