✦ LIBER ✦

Decomposition of Km,n(Km,n∗) into cycles (circuits) of length 2k

✍ Scribed by D Sotteau

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decompositions of Km,n into cubes

✍ Saad El-Zanati; Charles Vanden Eynden 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 384 KB

For a complete bipartite graph to be decomposable into isomorphic cubes, certain conditions on the number of cube and bipartition vertices must hold. We prove these necessary conditions sufficient in some cases. For cubes of fixed dimension d (indeed for d-regular bipartite graphs in general) we sho

Note on the decomposition of λKm,n (λKm,

Note on the decomposition of λKm,n (λKm,n*) into paths

✍ Mirosław Truszczyński 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 450 KB

In this paper we investigate decompositions of a complete bipartite symmetric multidigraph ~fcL, and a complete bipartite multigraph AK," into paths of the same length. We give some necessary and/or sufficient conditions for such a decomposition to exist. We obtain also some results for the case whe

Decomposition of k∗n into circuits of od

Decomposition of k∗n into circuits of odd length

✍ D. Sotteau 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 849 KB

n 1 his paper we prov that the complete symmetric directed graph with j'~ vertices Ki be dt?ct~mposed into irected circuits of length k, where k is an odd integer, if n = 0 or i (meld k ) and rl b k.

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

Experience with hydrofracture stress mea

Experience with hydrofracture stress measurements to depths of 2.6km and implications for measurements to 6km in Carnmenellis granite : Pine, R J; Kwakwa, K A Int J Rock Mech Min SciV26, N6, Dec 1989, P565–571

📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 114 KB 👁 2 views

A partial m=(2k+1)-cycle system of order

A partial m=(2k+1)-cycle system of order n can be embedded in an m-cycle system of order (2n+1)m

✍ C.C. Lindner; C.A. Rodger 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 566 KB

A generalization of Cruse's Theorem on embedding partial idempotent commutative latin squares is developed and used to show that a partial m = (2k + I)-cycle system of order n can be embedded in an m-cycle system of order tm for every odd t 2 (2n + 1).