{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:23Z","timestamp":1753893863335,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Given a non-negative integer $j$ and a positive integer $k$, a $j$-restricted $k$-matching in a simple undirected graph is a $k$-matching, so that each of its connected components has at least $j+1$ edges. The maximum non-negative node weighted $j$-restricted $k$-matching problem was recently studied by Li who gave a polynomial-time algorithm and a min-max theorem for $0 \\leqslant j &lt; k$, and also proved the NP-hardness of the problem with unit node weights and $2 \\leqslant k \\leqslant j$. In this paper we derive an Edmonds\u2013Gallai-type decomposition theorem for the $j$-restricted $k$-matching problem with $0 \\leqslant j &lt; k$, using the analogous decomposition for $k$-piece packings given by Janata, Loebl and Szab\u00f3, and give an alternative proof to the min-max theorem of Li.<\/jats:p>","DOI":"10.37236\/7837","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T00:59:05Z","timestamp":1578617945000},"source":"Crossref","is-referenced-by-count":0,"title":["An Edmonds-Gallai-Type Decomposition for the j-Restricted k-Matching Problem"],"prefix":"10.37236","volume":"27","author":[{"given":"Yanjun","family":"Li","sequence":"first","affiliation":[]},{"given":"J\u00e1cint","family":"Szab\u00f3","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2020,1,10]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i1p15\/8000","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i1p15\/8000","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T22:59:46Z","timestamp":1579215586000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v27i1p15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,10]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,1,9]]}},"URL":"https:\/\/doi.org\/10.37236\/7837","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2020,1,10]]},"article-number":"P1.15"}}