✦ LIBER ✦

Uniform generation of random regular graphs of moderate degree

✍ Scribed by Brendan D McKay; Nicholas C Wormald

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 795 KB
Volume: 11
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(90)90029-e

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian cycles in regular graphs of

Hamiltonian cycles in regular graphs of moderate degree

✍ Paul Erdös; Arthur M Hobbs 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 200 KB

Fast uniform generation of regular graph

Fast uniform generation of regular graphs

✍ Mark Jerrum; Alistair Sinclair 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 896 KB

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.

Factorizations of regular graphs of high

Factorizations of regular graphs of high degree

✍ A. J. W. Hilton 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB 👁 1 views

A p-factor of a graph G is a regular spanning subgraph of degree p . For G regular of degree d ( G ) and order 2n, let ( p l , ..., p,) be a partition of d ( G ) , so that p i > 0 ( I S i S r ) and p , i i pr = d(G). If H I . ..., H, are edge-disjoint regular spanning subgraphs of G of degrees p I ,

1-Factorizations of random regular graph

1-Factorizations of random regular graphs

✍ M. S. O. Molloy; H. Robalewska; R. W. Robinson; N. C. Wormald 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB 👁 2 views

It is shown that for each r G 3, a random r-regular graph on 2 n vertices is equivalent in a certain sense to a set of r randomly chosen disjoint perfect matchings of the 2 n vertices, as n ª ϱ. This equivalence of two sequences of probabilistic spaces, called contiguity, occurs when all events almo

On cycle lengths in graphs of moderate d

On cycle lengths in graphs of moderate degree

✍ H. Bencherif Ait-Djafer 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 447 KB

We show that for all positive E, an integer N(E) exists such that if G is any graph of order n>N(s) with minimum degree 63324 then G contains a cycle of length 21 for each integer 1, 2<1<~/(16+s). Bondy [4] and Woodall [15] have obtained sufficient conditions for a graph to contain cycles of each le