Edge Decompositions of Multigraphs into 3-Matchings
✍ Scribed by Zbigniew Lonc; Mariusz Meszka; Zdzisław Skupień
- Publisher
- Springer Japan
- Year
- 2004
- Tongue
- English
- Weight
- 278 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
We study the Ha ¨ggkvist conjecture which states that, for each tree T with n edges, there is an edge-partition of the complete bipartite graph K n;n into n isomorphic copies of T . We use the concept of bigraceful labelings, introduced in [7], which give rise to cyclic decompositions of K n;n . Whe