{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T03:02:46Z","timestamp":1780455766192,"version":"3.54.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3643,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0166-218x(02)00461-4","type":"journal-article","created":{"date-parts":[[2003,8,12]],"date-time":"2003-08-12T11:29:34Z","timestamp":1060687774000},"page":"337-346","source":"Crossref","is-referenced-by-count":26,"title":["Restricted t-matchings in bipartite graphs"],"prefix":"10.1016","volume":"131","author":[{"given":"Andr\u00e1s","family":"Frank","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0166-218X(02)00461-4_BIB1","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s004930170009","article-title":"Uncrossing a family of set-pairs","volume":"21","author":"Fleiner","year":"2001","journal-title":"Combinatorica"},{"issue":"1","key":"10.1016\/S0166-218X(02)00461-4_BIB2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1006\/jctb.1995.1044","article-title":"Minimal edge-coverings of pairs of sets","volume":"65","author":"Frank","year":"1995","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(02)00461-4_BIB3","unstructured":"J. Geelen, The C6-free 2-factor problem in bipartite graphs is NP-complete, oral communication, December 1999."},{"key":"10.1016\/S0166-218X(02)00461-4_BIB4","series-title":"Integer Programming and Combinatorial Optimization","first-page":"234","article-title":"The square-free 2-factor problem in bipartite graphs","volume":"Vol. 1610","author":"Hartvigsen","year":"1999"},{"key":"10.1016\/S0166-218X(02)00461-4_BIB5","unstructured":"D. Hartvigsen, Finding maximum square-free 2-matchings in bipartite graphs, September 2000, manuscript (detailed and improved version of [4])."},{"key":"10.1016\/S0166-218X(02)00461-4_BIB6","unstructured":"Z. Kir\u00e1ly, Square-free 2-matchings in bipartite graphs, Technical Report of Egerv\u00e1ry Research Group, TR-2001013, November 1999 (www.cs.elte.hu\/egres)."},{"key":"10.1016\/S0166-218X(02)00461-4_BIB7","unstructured":"Z. Kir\u00e1ly, Kt,t-free t-matchings in bipartite graphs, manuscript."},{"key":"10.1016\/S0166-218X(02)00461-4_BIB8","unstructured":"Z. Kir\u00e1ly, The minimum cost square-free 2-factor problem in bipartite graphs is NP-complete, oral communication."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004614?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004614?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T16:22:13Z","timestamp":1552580533000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02004614"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0166218X02004614"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00461-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}