𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generating all 4-regular planar graphs from the graph of the octahedron

✍ Scribed by Jenö Lehel

Publisher
John Wiley and Sons
Year
1981
Tongue
English
Weight
151 KB
Volume
5
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 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

Regular graphs constructed from the clas
Regular graphs constructed from the classical generalized quadrangle Q(4, q)
✍ L. Beukemann; K. Metsch 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

Let c k be the smallest number of vertices in a regular graph with valency k and girth 8. It is known that c k+1 ≥ 2(1+k+k 2 +k 3 ) with equality if and only if there exists a finite generalized quadrangle of order k. No such quadrangle is known when k is not a prime power. In this case, small regul

Connectivity of random regular graphs ge
Connectivity of random regular graphs generated by the pegging algorithm
✍ Pu Gao 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 1 views

## Abstract We study the connectivity of random __d__‐regular graphs which are recursively generated by an algorithm motivated by a peer‐to‐peer network. We show that these graphs are asymptotically almost surely __d__‐connected for any even constant __d__⩾4. © 2010 Wiley Periodicals, Inc. J Graph

The generalized acyclic edge chromatic n
The generalized acyclic edge chromatic number of random regular graphs
✍ Stefanie Gerke; Catherine Greenhill; Nicholas Wormald 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB 👁 1 views

## Abstract The __r__‐acyclic edge chromatic number of a graph is defined to be the minimum number of colors required to produce an edge coloring of the graph such that adjacent edges receive different colors and every cycle __C__ has at least min(|__C__|, __r__) colors. We show that (__r__ − 2)__d

On the number of cycles of length 4 in a
On the number of cycles of length 4 in a maximal planar graph
✍ Ahmad Fawzi Alameddine 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 148 KB 👁 2 views

## Abstract Let __p__ and __C__~4~ (__G__) be the number of vertices and the number of 4‐cycles of a maximal planar graph __G__, respectively. Hakimi and Schmeichel characterized those graphs __G__ for which __C__~4~ (__G__) = 1/2(__p__^2^ + 3__p__ ‐ 22). This characterization is correct if __p__ ≥