✦ LIBER ✦

Decomposition of the completer-graph into completer-partiter-graphs

✍ Scribed by Noga Alon

Publisher: Springer Japan
Year: 1986
Tongue: English
Weight: 307 KB
Volume: 2
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01788083

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 the Decomposition of Graphs into Comp

On the Decomposition of Graphs into Complete Bipartite Graphs

✍ Jinquan Dong; Yanpei Liu 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 118 KB

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

Complete partitions of graphs

✍ Magnús M. Halldórsson; Guy Kortsarz; Jaikumar Radhakrishnan; Sivaramakrishnan Si 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 393 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 biclique decompositions of complete t

On biclique decompositions of complete t-partite graphs

✍ Elizabeth D. Boyer; Bryan L. Shader 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 704 KB