✦ LIBER ✦

Generating r-regular graphs

✍ Scribed by Guoli Ding; Peter Chen

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 208 KB
Volume: 129
Category: Article
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(02)00593-0

No coin nor oath required. For personal study only.

✦ Synopsis

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 ÿxed g.

📜 SIMILAR VOLUMES

Generating Random Regular Graphs

✍ J. H. Kim; V. H. Vu* 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 325 KB

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 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.

Regular generalized polyomino graphs

✍ Shou-Zhong Wang; Rong Si Chen 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 237 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.

r-Regular, r-connected decompositions of

r-Regular, r-connected decompositions of complete graphs

✍ H. Fleischner; W. R. Johnstone; A. J. W. Hilton 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB 👁 2 views

If rjn À 1 and rn is even, then K n can be expressed as the union of t nÀ1 r edgedisjoint isomorphic r-regular r-connected factors.