𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Intersection of perfect 1-factorizations of complete graphs

✍ Scribed by A. P. Petrenyuk; A. Ya. Petrenyuk

Publisher
Springer US
Year
1980
Tongue
English
Weight
336 KB
Volume
16
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Cube factorizations of complete graphs
Cube factorizations of complete graphs
✍ Peter Adams; Darryn Bryant; Barbara Maenhaut πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 94 KB

## Abstract A cube factorization of the complete graph on __n__ vertices, __K~n~__, is a 3‐factorization of __K~n~__ in which the components of each factor are cubes. We show that there exists a cube factorization of __K~n~__ if and only if __n__ ≑ 16 (mod 24), thus providing a new family of unifor

On path factorizations of complete multi
On path factorizations of complete multipartite graphs
✍ Min-li Yu πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 523 KB

## Necessary conditions for IK(n, r), the complete multipartite graph with r parts of size n in which each edge has multiplicity 1, to have a P,-factorization are nr=O(mod k) and i(r-l)kn=O(mod2(k-1)). We show that when n=O(modk) or r=O(modk), these two conditions are also sufficient. (This impli

Factorizations of complete multipartite
Factorizations of complete multipartite graphs into generalized cubes
✍ El--Zanati, S.; Vanden Eynden, C. πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 100 KB πŸ‘ 2 views

For a positive integer d, the usual d-dimensional cube Q d is defined to be the graph (K 2 ) d , the Cartesian product of d copies of K 2 . We define the generalized cube Q(K k , d) to be the graph (K k ) d for positive integers d and k. We investigate the decomposition of the complete multipartite

Hamilton cycle rich two-factorizations o
Hamilton cycle rich two-factorizations of complete graphs
✍ Darryn Bryant πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 105 KB

## Abstract For all integers __n__ β‰₯ 5, it is shown that the graph obtained from the __n__‐cycle by joining vertices at distance 2 has a 2‐factorization is which one 2‐factor is a Hamilton cycle, and the other is isomorphic to any given 2‐regular graph of order __n__. This result is used to prove s

An algorithm for finding factorizations
An algorithm for finding factorizations of complete graphs
✍ A. J. W. Hilton; Matthew Johnson πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 58 KB πŸ‘ 1 views

## Abstract We show how to find a decomposition of the edge set of the complete graph into regular factors where the degree and edge‐connectivity of each factor is prescribed. Β© 2003 Wiley Periodicals, Inc. J Graph Theory 43: 132–136, 2003