✦ LIBER ✦

Hamilton Cycle Rich 2-factorizations of Complete Multipartite Graphs

✍ Scribed by L. McCauley; C. A. Rodger

Publisher: Springer Japan
Year: 2008
Tongue: English
Weight: 81 KB
Volume: 24
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-008-0763-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Maximal sets of hamilton cycles in compl

Maximal sets of hamilton cycles in complete multipartite graphs

✍ Mike Daven; J. A. MacDougall; C. A. Rodger 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 2 views

## Abstract A set __S__ of edge‐disjoint hamilton cycles in a graph __G__ is said to be __maximal__ if the edges in the hamilton cycles in __S__ induce a subgraph __H__ of __G__ such that __G__ − __E__(__H__) contains no hamilton cycles. In this context, the spectrum __S__(__G__) of a graph __G__ i

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

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 $

Nondisconnecting disentanglements of ama

Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs

✍ C. D. Leach; C. A. Rodger 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB

## 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__

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