✦ LIBER ✦

R70-22 Subdirect Decompositions of Transformation Graphs

✍ Scribed by Turner, J.

Book ID: 114587715
Publisher: IEEE
Year: 1970
Tongue: English
Weight: 336 KB
Volume: C-19
Category: Article
ISSN: 0018-9340
DOI: 10.1109/t-c.1970.223009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Subdirect decompositions of transformati

Subdirect decompositions of transformation graphs

✍ M. Yoeli; C.M. Ablow 📂 Article 📅 1968 🏛 Elsevier Science ⚖ 683 KB

r-Regular, r-connected decompositions of

r-Regular, r-connected decompositions of complete graphs

✍ H. Fleischner; W. R. Johnstone; A. J. W. Hilton 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB 👁 2 views

If rjn À 1 and rn is even, then K n can be expressed as the union of t nÀ1 r edgedisjoint isomorphic r-regular r-connected factors.

R70-45 On Decompositions of Regular Even

R70-45 On Decompositions of Regular Events

✍ Paz, A. 📂 Article 📅 1970 🏛 IEEE 🌐 English ⚖ 102 KB

R70-26 Probabilistic Aspects of Machine

R70-26 Probabilistic Aspects of Machine Decomposition Theory

✍ Yoeli, M. 📂 Article 📅 1970 🏛 IEEE 🌐 English ⚖ 274 KB

R70-14 Some Results on Cascade Decomposi

R70-14 Some Results on Cascade Decomposition of Automata

✍ Cutlip, W.F. 📂 Article 📅 1970 🏛 IEEE 🌐 English ⚖ 248 KB

On decomposition of r-partite graphs int

On decomposition of r-partite graphs into edge-disjoint hamilton circuits

✍ Renu Laskar; Bruce Auerbach 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 414 KB

Let It'Qn; r) denote the complete s-partite graph Kin, n, '.., n). it is shown hzre that for all even n(r -I) 2, Kfn; P) is the union of n(r -'I)/2 of its Hamilton circrlits which are mutually edge-disjoint, and for all odd nfr -1) 3 1, K(n; P) is the union of b(P -f) -r,,rs f l t ii o I s amilton c