𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs

✍ Scribed by C. D. Leach; C. A. Rodger

Publisher
John Wiley and Sons
Year
2001
Tongue
English
Weight
126 KB
Volume
9
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

In this paper necessary and sufficient conditions are found for an edge‐colored graph H to be the homomorphic image of a 2‐factorization of a complete multipartite graph G in which each 2‐factor of G has the same number of components as its corresponding color class in H. This result is used to completely solve the problem of finding hamilton decompositions of K~a,b~ − E(U) for any 2‐factor U of K~a,b~. © 2001 John Wiley & Sons, Inc. J Combin Designs 9: 460–467, 2001

📜 SIMILAR VOLUMES

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 decompositions of complete mult
Hamilton decompositions of complete multipartite graphs with any 2-factor leave
✍ C. D. Leach; C. A. Rodger 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 85 KB 👁 1 views

## Abstract For __m__ ≥ 1 and __p__ ≥ 2, given a set of integers __s__~1~,…,__s__~__q__~ with $s\_j \geq p+1$ for $1 \leq j \leq q$ and ${\sum \_{j\,=\,1}^q} s\_j = mp$, necessary and sufficient conditions are found for the existence of a hamilton decomposition of the complete __p__‐partite graph $

On minimum sets of 1-factors covering a
On minimum sets of 1-factors covering a complete multipartite graph
✍ David Cariolaro; Hung-Lin Fu 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 132 KB 👁 1 views

## Abstract We determine necessary and sufficient conditions for a complete multipartite graph to admit a set of 1‐factors whose union is the whole graph and, when these conditions are satisfied, we determine the minimum size of such a set. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:239‐250,

Some new results on 1-rotational 2-facto
Some new results on 1-rotational 2-factorizations of the complete graph
✍ Tommaso Traetta 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

## Abstract It is known that a necessary condition for the existence of a 1‐rotational 2‐factorization of the complete graph __K__~2__n__+1~ under the action of a group __G__ of order 2__n__ is that the involutions of __G__ are pairwise conjugate. Is this condition also sufficient? The complete ans

On 2-factorizations of the complete grap
On 2-factorizations of the complete graph: From the k-pyramidal to the universal property
✍ Simona Bonvicini; Giuseppe Mazzuoccolo; Gloria Rinaldi 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB 👁 1 views

## Abstract We consider 2‐factorizations of complete graphs that possess an automorphism group fixing __k__⩾0 vertices and acting sharply transitively on the others. We study the structures of such factorizations and consider the cases in which the group is either abelian or dihedral in some more d