
doi: 10.37236/4634
It is shown that if $G$ is any bipartite 2-regular graph of order at most $n/2$ or at least $n-2$, then the obvious necessary conditions are sufficient for the existence of a decomposition of the complete graph of order $n$ into a perfect matching and edge-disjoint copies of $G$.
Other designs, configurations, 2604 Applied Mathematics, graph decompositions, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph designs and isomorphic decomposition, 2607 Discrete Mathematics and Combinatorics, 2608 Geometry and Topology, 2614 Theoretical Computer Science, 1703 Computational Theory and Mathematics
Other designs, configurations, 2604 Applied Mathematics, graph decompositions, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph designs and isomorphic decomposition, 2607 Discrete Mathematics and Combinatorics, 2608 Geometry and Topology, 2614 Theoretical Computer Science, 1703 Computational Theory and Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
