✦ LIBER ✦

Isomorphic factorizations VII. Regular graphs and tournaments

✍ Scribed by N. C. Wormald

Publisher: John Wiley and Sons
Year: 1984
Tongue: English
Weight: 272 KB
Volume: 8
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190080114

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On isomorphic factorizations of circulan

On isomorphic factorizations of circulant graphs

✍ Brian Alspach; Danny Dyer; Donald L. Kreher 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

## Abstract We investigate the conjecture that every circulant graph __X__ admits a __k__‐isofactorization for every __k__ dividing |__E__(__X__)|. We obtain partial results with an emphasis on small values of __k__. © 2006 Wiley Periodicals, Inc. J Combin Designs 14: 406–414, 2006

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 ,

Regular Graphs, Eigenvalues and Regular

Regular Graphs, Eigenvalues and Regular Factors

✍ Hongliang Lu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 97 KB

## Abstract In this article, we obtain a sufficient condition for the existence of regular factors in a regular graph in terms of its third largest eigenvalue. We also determine all values of __k__ such that every __r__‐regular graph with the third largest eigenvalue at most has a __k__‐factor.

The divisibility theorem for isomorphic

The divisibility theorem for isomorphic factorizations of complete graphs

✍ Frank Harary; Robert W. Robinson; Nicholas C. Wormald 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 91 KB

One-factorizations of complete graphs wi

One-factorizations of complete graphs with vertex-regular automorphism groups

✍ Arrigo Bonisoli; Domenico Labbate 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

## Abstract We consider one‐factorizations of __K__~2__n__~ possessing an automorphism group acting regularly (sharply transitively) on vertices. We present some upper bounds on the number of one‐factors which are fixed by the group; further information is obtained when equality holds in these boun