Abstract
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.
Similar content being viewed by others
References
Ban, A.: Decomposing weighted graphs. J. Graph Theory 86, 250–254 (2017)
Bazgan, C., Tuza, Z., Vanderpooten, D.: Efficient algorithms for decomposing graphs under degree constraints. Discrete Appl. Math. 155, 979–988 (2007)
Diwan, A.A.: Decomposing graphs with girth at least five under degree constraints. J. Graph Theory 33, 237–239 (2000)
Gerber, M.U., Kobler, D.: Classes of graphs that can be partitioned to satisfy all their vertices. Aust. J. Combin. 29, 201–214 (2004)
Hajnal, P.: Partition of graphs with condition on the connectivity and minimum degree. Combinatorica 3, 95–99 (1983)
Hou, J., Ma, H., Yu, J., Zhang, X.: On partitions of \(K_{2,3}\)-free graphs under degree constraints. Discrete Math. 341, 3288–3295 (2018)
Kaneko, A.: On decomposition of triangle-free graphs under degree constraints. J. Graph Theory 27, 7–9 (1998)
Liu, M., Xu, B.: On partitions of graphs under degree constraints. Discrete Appl. Math. 226, 87–93 (2017)
Liu, M., Xu, B.: On a conjecture of Schweser and Stiebitz. Discrete Appl. Math. 295, 25–31 (2021)
Ma, J., Yang, T.: Decomposing \(C_4\)-free graphs under degree constraints. J. Graph Theory 90, 13–23 (2019)
Stiebitz, M.: Decomposing graphs under degree constraints. J. Graph Theory 23, 321–324 (1996)
Schweser, T., Stiebitz, M.: Partitions of multigraphs under minimum degree constraints. Discrete Appl. Math. 257, 269–275 (2019)
Song, J., Xu, B.: Partitions of graphs and multigraphs under degree constraints. Discrete Appl. Math. 279, 134–145 (2020)
Thomassen, C.: Graph decomposition with constraints on the connectivity and minimum degree. J. Graph Theory 7, 165–167 (1983)
Zu, C.: A note on partitions of graphs under degree constraints. Discrete. Appl. Math. 283, 631–633 (2020)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Partially supported by NSFC projects 11931006.
Rights and permissions
About this article
Cite this article
Song, J., Xu, B. Partitions of Multigraphs Without \(C_4\). Graphs and Combinatorics 37, 2095–2111 (2021). https://doi.org/10.1007/s00373-021-02335-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-021-02335-4