✦ LIBER ✦

On biclique decompositions of complete t-partite graphs

✍ Scribed by Elizabeth D. Boyer; Bryan L. Shader

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 704 KB
Volume: 217
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(94)00140-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On biclique partitions of the complete g

On biclique partitions of the complete graph

✍ Bryan L. Shader 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 930 KB

Hamiltonian decompositions of complete r

Hamiltonian decompositions of complete regular s-partite graphs

✍ A.J.W. Hilton; C.A. Rodger 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 962 KB

In this paper we give a procedure by which Hamiltonian decompositions of the s-partite graph K~.....,~, where (s-1)n is even, can be constructed. For 2t<~s, l<~al<~...<~a~n, we find conditions which are necessary and sufficient for a decomposition of the edge-set of Kal.a2..... ~ into (s-1)n/2 class

On the decomposition of Kn into complete

On the decomposition of Kn into complete m-partite graphs

✍ Qingxue Huang 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB 👁 1 views

## Abstract Graham and Pollak [3] proved that __n__ −1 is the minimum number of edge‐disjoint complete bipartite subgraphs into which the edges of __K__~__n__~ can be decomposed. Using a linear algebraic technique, Tverberg [2] gives a different proof of that result. We apply his technique to show

On resolvable tree-decompositions of com

On resolvable tree-decompositions of complete graphs

✍ Zbigniew Lonc 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 355 KB 👁 1 views

A partition of the edge set of a graph H into subsets inducing graphs H,, . . . , H, isomorphic to a graph G is said to be a G-decomposition of H. A G-decomposition of H is resolvable if the set {H,, . . . , H,} can be partitioned into subsets, called resolution classes, such that each vertex of H

On balanced claw designs of complete mul

On balanced claw designs of complete multi-partite graphs

✍ Kazuhiko Ushio 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 201 KB

In this paDer,

Commuting decompositions of complete gra

Commuting decompositions of complete graphs

✍ Saieed Akbari; Allen Herman 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB

## Abstract We say that two graphs __G__ and __H__ with the same vertex set commute if their adjacency matrices commute. In this article, we show that for any natural number __r__, the complete multigraph __K__ is decomposable into commuting perfect matchings if and only if __n__ is a 2‐power. Also