English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Let $k$, $\lambda$ and $\mu$ be positive integers. A decomposition of amultigraph $ \lambda G$ into edge-disjoint subgraphs $G_1, \ldots , G_k$ issaid to be \emph{enclosed} by a decomposition of a multigraph $\mu H$ intoedge-disjoint subgraphs $H_1, \ldots , H_k$ if $\mu > \lambda$ and $G_i$ is asubgraph of $H_i$, $1 \leq i \leq k$. In this paper we initiate the study ofwhen a decomposition can be enclosed by a decomposition that consists ofspanning subgraphs.  A decomposition of a graph is a 2-factorization if each subgraph is 2-regularand is Hamiltonian if each subgraph is a Hamiltonian cycle. Let $n$ and $m$ bepositive integers. We give necessary and sufficient conditions for enclosing adecomposition of $\lambda K_n$ in a $2$-factorization of $\mu K_{n+m}$ whenever$\mu>\lambda$ and $m \geq n-2$. We also give necessary and sufficientconditions for enclosing a decomposition of $\lambda K_n$ in a Hamiltoniandecomposition of $\mu K_{n+m}$ whenever $\mu > \lambda$ and $m \geq n-1$, or$\mu > \lambda$, $n=3$ and $m=1$, or $\mu = 2$, $\lambda=1$ and $m=n-2$.

Enclosings of Decompositions of Complete Multigraphs in 2-Factorizations