✦ LIBER ✦

Decomposition of equiaffinities into reflections

✍ Scribed by Erich W. Ellers

Publisher: Springer
Year: 1977
Tongue: English
Weight: 486 KB
Volume: 6
Category: Article
ISSN: 0046-5755
DOI: 10.1007/bf02429902

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Evaluation of peat decomposition by refl

Evaluation of peat decomposition by reflectivity

✍ J. Grandmaison; Y. Laflamme 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 266 KB

Decompositions of graphs into trees

✍ Zbigniew Lonc 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 460 KB

Decompositions of hypergraphs into hyper

Decompositions of hypergraphs into hyperstars

✍ Zbigniew Lonc 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 630 KB

In the paper we investigate decompositions of hypergraphs into hyperstars. A hyperstar with center F and size c is every hypergraph (X, ~) such that F c\_ n ~ and I~1 = c. A decomposition of a hypergraph (X, ~) into hypergraphs from a certain class YC is a family of hypergraphs {Hi = (X, ~i): i • I}

Decomposition of Gödelnumberings into Fr

Decomposition of Gödelnumberings into Friedbergnumberings

✍ Britta Schinzel 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 458 KB

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

The decomposition of trees into subtrees

✍ Yair Caro 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 332 KB

## Abstract A necessary condition for the decomposition of a tree __T__ into subtrees, each isomorphic to a tree from a given set of trees is presented. We also present a characterization of the set of trees for which the condition is sufficient. Many examples are given.