𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Regular generalized polyomino graphs

✍ Scribed by Shou-Zhong Wang; Rong Si Chen

Publisher
Springer
Year
2006
Tongue
English
Weight
237 KB
Volume
42
Category
Article
ISSN
0259-9791

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Combinatorially Regular Polyomino Tiling
Combinatorially Regular Polyomino Tilings
✍ James W. Cannon; William J. Floyd; Walter R. Parry πŸ“‚ Article πŸ“… 2005 πŸ› Springer 🌐 English βš– 260 KB
Generating r-regular graphs
Generating r-regular graphs
✍ Guoli Ding; Peter Chen πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 208 KB

For each nonnegative integer r, we determine a set of graph operations such that all r-regular loopless graphs can be generated from the smallest r-regular loopless graphs by using these operations. We also discuss possible extensions of this result to r-regular graphs of girth at least g, for each

Generating Random Regular Graphs
Generating Random Regular Graphs
✍ J. H. Kim; V. H. Vu* πŸ“‚ Article πŸ“… 2006 πŸ› Springer-Verlag 🌐 English βš– 325 KB
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