Skip to main content
SpringerLink
Log in

Edge Decompositions of Multigraphs into 3-Matchings

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Information Sciences, Warsaw University of Technology, pl. Politechniki, 1 00-661, Warsaw, Poland

    Zbigniew Lonc

  2. Faculty of Applied Mathematics, AGH University of Science and Technology, al. Mickiewicza, 30 30-059, Kraków, Poland

    Mariusz Meszka & Zdzisław Skupień

Authors
  1. Zbigniew Lonc
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mariusz Meszka
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zdzisław Skupień
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mariusz Meszka.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-004-0581-0

Keywords

Search

Navigation