✦ LIBER ✦

Factorizations of regular graphs

✍ Scribed by Cun-Quan Zhang; Yong-Jin Zhu

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 860 KB
Volume: 56
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(92)90008-l

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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 cartesian products o

1-Factorizations of cartesian products of regular graphs

✍ Anton Kotzig 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 562 KB

Isomorphic factorizations VII. Regular g

Isomorphic factorizations VII. Regular graphs and tournaments

✍ N. C. Wormald 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 272 KB

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

Factorizations of 4-Regular Graphs and P

Factorizations of 4-Regular Graphs and Petersen′s Theorem

✍ M. Kouider; G. Sabidussi 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 513 KB

On the basis of the observation that a 3-regular graph has a perfect matching if and only if its line graph has a triangle-free 2 -factorisation, we show that a connected 4-regular graph has a triangle-free 2 -factorisation, provided it has no more than two cut-vertices belonging to a triangle. This