๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the decomposition of a graph into stars

โœ Scribed by Michael Tarsi

Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
248 KB
Volume
36
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

It is known that whenever u(u -1) -0 (mod 2m) and u ~=2tn, the complete graph K, can be decomposed into edge disjoint, m-stars [l, 21. In this paper we prove that K, can be

๐Ÿ“œ SIMILAR VOLUMES

Packing almost stars into the complete g
Packing almost stars into the complete graph
โœ Dobson, Edward ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 79 KB ๐Ÿ‘ 2 views

We verify that the Tree Packing Conjecture is true for all sequences of trees T 1 , . . . , T n such that there exists x i โˆˆ V (T i ) and T i -x i has at least i -6(i -1)/4 isolated vertices.

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.

Decompositions of graphs into trees
Decompositions of graphs into trees
โœ Zbigniew Lonc ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 460 KB
Decomposition of complete multigraphs in
Decomposition of complete multigraphs into stars
โœ Michael Tarsi ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 531 KB

A necessary and sufficient condition for the existence of a decomposition of A&, irto stars is given. A complete multigraph AK, is a complete graph & in which every edge is taken A times. A complete multigraph A&, is said to have a G-decomposition G[h, v] if it is a union of edge disjoint subgraphs