✦ LIBER ✦

Almost resolvable decomposition of Kn∗

✍ Scribed by F.E Bennett; D Sotteau

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 202 KB
Volume: 30
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(81)90067-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Almost resolvable decompositions of 2Kn

Almost resolvable decompositions of 2Kn into cycles of odd length

✍ Katherine Heinrich; C.C Lindner; C.A Rodger 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 706 KB

Resolvable decomposition of Kn∗

✍ J.C Bermond; A Germa; D Sotteau 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 357 KB

Almost resolvable Pk-decompositions of c

Almost resolvable Pk-decompositions of complete graphs

✍ Min-Li Yu 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 925 KB

## Abstract An almost __P__~__k__~‐factor of __G__ is a __P__~__k__~‐factor of __G__ ‐ {__v__} for some vertex __v.__ An almost resolvable __P__~__k__~‐decomposition of λ__K__~__n__~ is a partition of the edges of λ__K__~__n__~ into almost __P__~__k__~‐factors. We prove that necessary and sufficien

On large sets of resolvable and almost r

On large sets of resolvable and almost resolvable oriented triple systems

✍ Qingde Kang; Jianguo Lei 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 430 KB 👁 1 views

An MTS(v) [or DTS(v)] is said to be resolvable, denoted by RMTS(v) [or RDTS(v)], if its block set can be partitioned into parallel classes. An MTS(v) [or DTS(v)] is said to be almost resolvable, denoted by ARMTS(v) [or ARDTS(v)], if its bloak set can be partitioned into almost parallel classes. The

Cycle Decompositions of Kn and Kn−I

✍ Brian Alspach; Heather Gavlas 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 251 KB

We establish necessary and sufficient conditions for decomposing the complete graph of even order minus a 1-factor into even cycles and the complete graph of odd order into odd cycles.

Almost resolvable cycle systems—an analo

Almost resolvable cycle systems—an analogue of Hanani triple systems

✍ C. C. Lindner; M. Meszka; A. Rosa 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 123 KB

## Abstract The purpose of this paper is the initiation of an attack on the __general existence problem__ for almost resolvable 2__k__‐cycle systems. We give a complete solution for 2__k__=6 as well as a complete solution modulo one possible exception for 2__k__=10 and 14. We also show that the exi