𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalizations of planar graphs

✍ Scribed by Ranel E. Erickson

Publisher
John Wiley and Sons
Year
1982
Tongue
English
Weight
677 KB
Volume
12
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generating 5-regular planar graphs
Generating 5-regular planar graphs
✍ Guoli Ding; Jinko Kanno; Jianning Su 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

## Abstract For __k__=0, 1, 2, 3, 4, 5, let ${\cal{P}}\_{k}$ be the class of __k__ ‐edge‐connected 5‐regular planar graphs. In this paper, graph operations are introduced that generate all graphs in each ${\cal{P}}\_{k}$. © 2009 Wiley Periodicals, Inc. J Graph Theory 61: 219–240, 2009

Generating all 4-regular planar graphs f
Generating all 4-regular planar graphs from the graph of the octahedron
✍ Jenö Lehel 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB 👁 1 views

## Abstract It has been communicated by P. Manca in this journal that all 4‐regular connected planar graphs can be generated from the graph of the octahedron using simple planar graph operations. We point out an error in the generating procedure and correct it by including an additional operation.

-constructibility of planar graphs
-constructibility of planar graphs
✍ C. M. Mynhardt; I. Broere 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 386 KB

## Abstract In this paper, the concept of the 𝒢‐constructibility of graphs is introduced and investigated with particular reference to planar graphs. It is conjectured that the planar graphs are minimally __N__‐constructible, where __N__ is a finite set of graphs and an infinite set 𝒢 is obtained s

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

Some generalizations of the steiner prob
Some generalizations of the steiner problem in graphs
✍ C. W. Duin; A. Volgenant 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 562 KB

The Steiner Problem in Graphs (SP) is the problem of finding a set of edges with minimum total weight which connects a given subset of nodes in an edge-weighted (undirected) graph. In the more general Node-weighted Steiner Problem (NSP) also node weights are considered. A restricted minimum spanning