𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generating 5-regular planar graphs

✍ Scribed by Guoli Ding; Jinko Kanno; Jianning Su

Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
210 KB
Volume
61
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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

πŸ“œ 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

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.

Generating all planer graphs regular of
Generating all planer graphs regular of degree four
✍ Paolo Manca πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 225 KB πŸ‘ 1 views

## Abstract All planar connected graphs regular of degree four can be generated from the graph of the octahedron, using four operations.

Generalizations of planar graphs
Generalizations of planar graphs
✍ Ranel E. Erickson πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 677 KB
Generating and Counting Hamilton Cycles
Generating and Counting Hamilton Cycles in Random Regular Graphs
✍ Alan Frieze; Mark Jerrum; Michael Molloy; Robert Robinson; Nicholas Wormald πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 216 KB

Let G be chosen uniformly at random from the set G G r, n of r-regular graphs w x Ε½ . with vertex set n . We describe polynomial time algorithms that whp i find a Ε½ . Hamilton cycle in G, and ii approximately count the number of Hamilton cycles in G.