Enclosings of Decompositions of Complete Multigraphs in $2$-Edge-Connected $r$-Factorizations

John Asplund, Pierre Charbit, Carl Feghali

A decomposition of a multigraph $G$ is a partition of its edges into subgraphs $G(1),\dots ,G(k)$. It is called an $r$-factorization if every $G(i)$ is $r$-regular and spanning.…