2 problems

Let $G$ be a multigraph with maximum degree $\Delta(G)$ and maximum multiplicity $\mu(G)$. A forbidden matching is a matching whose edges have been assigned arbitrary, not necessar…

Let $G$ be a multigraph with maximum degree $\Delta(G)$ and maximum multiplicity $\mu(G)$. A precoloured matching is a matching whose edges have been assigned colours from a palett…