✦ LIBER ✦

Decomposition of product graphs into complete bipartite subgraphs

✍ Scribed by Bruce Reznick; Prasoon Tiwari; Douglas B West

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 291 KB
Volume: 57
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(85)90167-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A decomposition of complete bipartite gr

A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components

✍ Yoshimi Egawa; Masatsugu Urabe; Toshihito Fukuda; Seiichiro Nagoya 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 114 KB

On the decomposition of kn into complete

On the decomposition of kn into complete bipartite graphs

✍ H. Tverberg 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 76 KB 👁 1 views

## Abstract A short proof is given of the impossibility of decomposing the complete graph on __n__ vertices into __n__‐2 or fewer complete bipartite graphs.

Sharp bounds for decompositions of graph

Sharp bounds for decompositions of graphs into completer-partite subgraphs

✍ Gregory, David A.; Vander Meulen, Kevin N. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 435 KB 👁 2 views

If G is a graph on n vertices and r 2 2, w e let m,(G) denote the minimum number of complete multipartite subgraphs, with r or fewer parts, needed to partition the edge set, f(G). In determining m,(G), w e may assume that no two vertices of G have the same neighbor set. For such reduced graphs G, w

On the decomposition of a complete graph

On the decomposition of a complete graph into planar subgraphs

✍ Isao Shirakawa; Hiromitsu Takahashi; Hiroshi Ozaki 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 692 KB

Packing two bipartite graphs into a comp

Packing two bipartite graphs into a complete bipartite graph

✍ Wang, Hong 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB 👁 3 views

For two integers a and b, we say that a bipartite graph G admits an (a, b)bipartition if G has a bipartition (X, Y ) such that |X| = a and |Y | = b. We say that two bipartite graphs G and H are compatible if, for some integers a and b, both G and H admit (a, b)-bipartitions. In this paper, we prove

Decomposition of complete graphs into 5-

Decomposition of complete graphs into 5-cubes

✍ D. Bryant; S. I. El-Zanati; B. Maenhaut; C. Vanden Eynden 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB

## Abstract Necessary conditions for the complete graph on __n__ vertices to have a decomposition into 5‐cubes are that 5 divides __n__ − 1 and 80 divides __n__(__n__ − 1)/2. These are known to be sufficient when __n__ is odd. We prove them also sufficient for __n__ even, thus completing the spectr