Let G be a graph that may have multiedges, let \(\mu (u, v)\) denote the number of edges joining u and v in G, and let \(\mu (u)=\max _{v\in N(u)} \mu (u, v)\). Let \(a, b:V(G)\ \longrightarrow {\mathbb {N}}{\setminus }\{0,1\}\) be two functions with \(d_G(v)\ge a(v)+b(v)+2\mu (v)-3\) for each \(v\in V(G)\). We show that, if G does not contain \(C_4\), then G admits a partition (A, B) with \(d_{G[A]}(u)\ge a(u)\) for each \(u\in A\), and \(d_{G[B]}(v)\ge b(v)\) for each \(v\in B\). This generalizes a theorem of Ma and Yang on simple graphs, and answers a question of Schweser and Stiebitz.

让ģ是可以具有multiedges，让一个图表\（\亩（U，V）\）表示边缘接合的数量ü和v在ģ，并让\（\亩（U）= \最大_ {V \在 N(u)} \mu (u, v)\) 中。设\(a, b:V(G)\ \longrightarrow {\mathbb {N}}{\setminus }\{0,1\}\)是两个函数，其中\(d_G(v)\ge a(v) +b(v)+2\mu (v)-3\)对于每个\(v\in V(G)\)。我们证明，如果G不包含\(C_4\)，那么G承认一个分区 ( A ,  B ) 与\(d_{G[A]}(u)\ge a(u)\)对于每个\(你\在 A\)，和\(d_{G[B]}(v)\ge b(v)\)对于每个\(v\in B\)。这在简单图上推广了 Ma 和 Yang 的定理，并回答了 Schweser 和 Stiebitz 的问题。