{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T06:37:16Z","timestamp":1776321436697,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s1571-0653(05)80154-4","type":"journal-article","created":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T11:08:52Z","timestamp":1114945732000},"page":"170-173","source":"Crossref","is-referenced-by-count":21,"special_numbering":"C","title":["Graph Packings"],"prefix":"10.1016","volume":"5","author":[{"given":"Pavol","family":"Hell","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(05)80154-4_BIB1","article-title":"Path packing in directed graphs","author":"Brewster","year":"1999","journal-title":"manuscript"},{"key":"10.1016\/S1571-0653(05)80154-4_BIB2","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0095-8956(86)90085-7","article-title":"An extension of matching theory","volume":"40","author":"Cornuejols","year":"1986","journal-title":"J. Combinatorial Th. B"},{"key":"10.1016\/S1571-0653(05)80154-4_BIB3","first-page":"139","volume":"1","author":"Cornuejols","year":"1982","journal-title":"Packing subgraphs in a graph, OR Letters"},{"key":"10.1016\/S1571-0653(05)80154-4_BIB4","first-page":"234","author":"Hartvigsen","year":"1999","journal-title":"The square-free 2-factor problem in bipartite graphs, IP CO"},{"key":"10.1016\/S1571-0653(05)80154-4_BIB5","article-title":"The k-piece packing problem","author":"Hartvigsen","year":"2000","journal-title":"manuscript"},{"key":"10.1016\/S1571-0653(05)80154-4_BIB6","first-page":"273","article-title":"Scheduling, matching, and colouring","volume":"25","author":"Hell","year":"1978","journal-title":"Colloquia Math. Soc. Bolyai"},{"key":"10.1016\/S1571-0653(05)80154-4_BIB7","first-page":"601","article-title":"On the complexity of general graph factor problems","volume":"l2","author":"Hell","year":"1983","journal-title":"SIAM J. Computing"},{"key":"10.1016\/S1571-0653(05)80154-4_BIB8","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/0012-365X(84)90150-X","article-title":"Packings by cliques and by finite families of graphs","volume":"49","author":"Hell","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/S1571-0653(05)80154-4_BIB9","first-page":"113","article-title":"Packings by complete bipartite graphs","volume":"7","author":"Hell","year":"1986","journal-title":"SIAM J. Algebraic and Discrete Math."},{"key":"10.1016\/S1571-0653(05)80154-4_BIB10","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1137\/0401046","article-title":"On restricted two-factors","volume":"4","author":"Hell","year":"1988","journal-title":"SIAM J. on Discrete Math."},{"key":"10.1016\/S1571-0653(05)80154-4_BIB11","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0166-218X(94)90148-1","article-title":"Packing problems in edge-coloured graphs","volume":"52","author":"Hell","year":"1994","journal-title":"Discrete Applied Math."},{"key":"10.1016\/S1571-0653(05)80154-4_BIB12","article-title":"On path factors and subfactors of graphs without length one","author":"Kano","year":"1999","journal-title":"manuscript"},{"key":"10.1016\/S1571-0653(05)80154-4_BIB13","article-title":"A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two","author":"Kaneko","year":"1999","journal-title":"manuscript"},{"key":"10.1016\/S1571-0653(05)80154-4_BIB14","article-title":"C4-free 2-factors in bipartite graphs","author":"Kir\u00e1ly","year":"1999","journal-title":"manuscript"},{"key":"10.1016\/S1571-0653(05)80154-4_BIB15","doi-asserted-by":"crossref","unstructured":"D.G. Kirkpatrick and P. Hell \u2013; On the completeness of a generalized matching problem, Proc. Tenth Annual ACM Symposium on Theory of Computing (STOC 1978) 240-245.","DOI":"10.1145\/800133.804353"},{"key":"10.1016\/S1571-0653(05)80154-4_BIB16","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1006\/jctb.1993.1058","article-title":"Efficient subgraph packing","volume":"59","author":"Loebl","year":"1993","journal-title":"J. Combinatorial Th. B"},{"key":"10.1016\/S1571-0653(05)80154-4_BIB17","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/0095-8956(88)90042-1","article-title":"On matroids induced by packing subgraphs","volume":"B44","author":"Loebl","year":"1988","journal-title":"J. Combinatorial Th."}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801544?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801544?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T05:18:00Z","timestamp":1586236680000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065305801544"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":17,"alternative-id":["S1571065305801544"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80154-4","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}