Abstract.
We find a necessary and sufficient condition for the existence of a partition of the edge set of a multigraph into matchings of size 3.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lonc, Z., Meszka, M. & Skupień, Z. Edge Decompositions of Multigraphs into 3-Matchings. Graphs and Combinatorics 20, 507–515 (2004). https://doi.org/10.1007/s00373-004-0581-0
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s00373-004-0581-0