✦ LIBER ✦

Fast uniform generation of regular graphs

✍ Scribed by Mark Jerrum; Alistair Sinclair

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 896 KB
Volume: 73
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(90)90164-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Uniform generation of random regular gra

Uniform generation of random regular graphs of moderate degree

✍ Brendan D McKay; Nicholas C Wormald 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 795 KB

Fast generation of regular graphs and co

Fast generation of regular graphs and construction of cages

✍ Meringer, Markus 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB 👁 2 views

The construction of complete lists of regular graphs up to isomorphism is one of the oldest problems in constructive combinatorics. In this article an efficient algorithm to generate regular graphs with a given number of vertices and vertex degree is introduced. The method is based on orderly genera

Fast generation of cubic graphs

✍ Brinkmann, Gunnar 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 620 KB

In this paper an efficient algorithm to generate regular graphs with small vertex valency is presented. The running times of a program based on this algorithm and designed to generate cubic graphs are below two natural benchmarks: (a) If N ( n ) denotes the number of pairwise non-isomorphic cubic gr

Deza graphs: A generalization of strongl

Deza graphs: A generalization of strongly regular graph

✍ M. Erickson; S. Fernando; W. H. Haemers; D. Hardy; J. Hemmeter 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB 👁 2 views

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

Regular factors of regular graphs

✍ B. Bollobás; Akira Saito; N. C. Wormald 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 242 KB

Given r 3 3 and 1 s A s r, we determine all values of k for which every r-regular graph with edge-connectivity A has a k-factor. Some of the earliest results in graph theory are due to Petersen [8] and concern factors in graphs. Among others, Petersen proved that a regular graph of even degree has a