Consider a regular tripartite graph $G$ with maximum degree $\Delta\ge3$ and parts $A,B,C$. Now, the induced subgraphs $A\cup B, B\cup C$ and $A\cup C$ are all bipartite.


Now, is there a way to choose disjoint matchings from the three bipartitie subgraphs such that the union of the three disjoint matchings yields us two disjoint maximal matchings of $G$. We could easily get one maximal matching by the union of three disjoint matchings obtained from the three distinct bipartite subgraphs, but getting two maximal matchings seems hard to me at present. Maybe, we must use some symmeteric difference of two matchings. But, anyways, it is unclear. Any hints? What if the graph $G$ were 1-factorizable, or, Class $1$? Thanks beforehand. 



Combining three matchings to form a maximal matching
Such a matching cannot be said to exist if the maximum degree of the bipartite graphs $A\cup B$, $B\cup C$ and $C\cup A$ are the same as that of the whole graph. This is because, if the individual bipartite graphs had $E\_1, E\_2, $ and $E\_3$ edges respectively, then the number of edges in the graph $G$ would be $E\_1+E\_2+E\_3=X$. Now, two maximal matchings of $G$ would have combined cardinality at least $\lfloor\frac{2X}{\Delta+1}\rfloor$. On the other hand the maximal matchings in the bipartite subgraphs together would have maximum cardinality at most $\lfloor\frac{E\_1}{\Delta}\rfloor+\lfloor\frac{E\_2}{\Delta}\rfloor+\lfloor\frac{E\_3}{\Delta}\rfloor\le \lfloor\frac{2X}{\Delta}\rfloor\neq\lfloor\frac{X}{\Delta+1}\rfloor$ generally, as the bipartite graphs have chromatic index $\Delta$. Therefore the maximum degree of the bipartite graphs must be less than that of the original graph for existence of such a phenomenon


