𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decomposition of bipartite multigraphs into matchings

✍ Scribed by D. de Werra

Publisher
Springer
Year
1972
Tongue
English
Weight
296 KB
Volume
16
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

An extension of bipartite multigraphs
An extension of bipartite multigraphs
✍ D. De Werra πŸ“‚ Article πŸ“… 1976 πŸ› Elsevier Science 🌐 English βš– 702 KB

Usual edge colorings have been generalized in various ways; we wilI consider here essentially good edge colorings as well as equitable edge colorings. It is known that bipartite multigraphs present the property of having an equitable k-coloring for each k 3 2. This implies that they also have a good

Applying a proof of tverberg to complete
Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs
✍ Dan Pritikin πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 195 KB

Graham and Pollak 121 proved that n -1 is the minimum number of edge-disjoint complete bipartite subgraphs into which the edges of K,, decompose. Tverberg 161, using a linear algebraic technique, was the first to give a simple proof of this result. We apply Tverberg's technique to obtain results for