{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T01:51:30Z","timestamp":1769219490760,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T00:00:00Z","timestamp":1612828800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T00:00:00Z","timestamp":1612828800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["11771080"],"award-info":[{"award-number":["11771080"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s10878-021-00708-2","type":"journal-article","created":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T02:17:08Z","timestamp":1612923428000},"page":"694-709","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["On maximum $$P_3$$-packing in claw-free subcubic graphs"],"prefix":"10.1007","volume":"41","author":[{"given":"Wenying","family":"Xi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4112-0469","authenticated-orcid":false,"given":"Wensong","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,9]]},"reference":[{"key":"708_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.3190090103","volume":"9","author":"J Akiyama","year":"1985","unstructured":"Akiyama J, Kano M (1985) Factors and factorizations of graphs\u2014a survey. J Graph Theory 9:1\u201342","journal-title":"J Graph Theory"},{"key":"708_CR2","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1007\/s10878-015-9884-8","volume":"32","author":"M-S Chang","year":"2016","unstructured":"Chang M-S, Chen L-H, Hung L-J (2016) An $$O^*(1.4366^n)$$-time exact algorithm for maximum $$P_2$$-packing in cubic graphs. J Combin Optim 32:594\u2013607","journal-title":"J Combin Optim"},{"key":"708_CR3","unstructured":"Chang M-S, Chen L-H, Hung L-J (2014) A $$5k$$ kernel for $$P_2$$-packing in net-free graphs. In: Proceedings of ICSEC, pp 12\u201317"},{"issue":"2","key":"708_CR4","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/0196-6774(86)90002-7","volume":"7","author":"ME Dyer","year":"1986","unstructured":"Dyer ME, Frieze AM (1986) Planar 3DM is NP-Complete. J Algorithms 7(2):174\u2013184","journal-title":"J Algorithms"},{"key":"708_CR5","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2013.12.011","volume":"522","author":"Q Feng","year":"2014","unstructured":"Feng Q, Wang J, Chen J (2014) Matching and weighted $$P_2$$-packing: algorithms and kernels. Theor Comput Sci 522:85\u201394","journal-title":"Theor Comput Sci"},{"key":"708_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10878-013-9691-z","volume":"19","author":"Q Feng","year":"2015","unstructured":"Feng Q, Wang J, Li S, Chen J (2015) Randomized parameterized algorithms for $$P_2$$-packing and co-path packing problems. J Combin Optim 19:125\u2013140","journal-title":"J Combin Optim"},{"key":"708_CR7","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10878-009-9230-0","volume":"18","author":"H Fernau","year":"2009","unstructured":"Fernau H, Raible D (2009) A parameterized perspective on packing paths of length two. J Combin Optim 18:319\u2013341","journal-title":"J Combin Optim"},{"issue":"1","key":"708_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0012-365X(84)90150-X","volume":"49","author":"P Hell","year":"1984","unstructured":"Hell P, Kirkpatrick DG (1984) Packing by cliques and by finite families of graphs. Discrete Math 49(1):45\u201359","journal-title":"Discrete Math"},{"issue":"2","key":"708_CR9","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1137\/0607024","volume":"7","author":"P Hell","year":"1986","unstructured":"Hell P, Kirkpatrick DG (1986) Packing by complete bipartite graphs. SIAM J Algebraic Discrete Methods 7(2):199\u2013209","journal-title":"SIAM J Algebraic Discrete Methods"},{"issue":"1","key":"708_CR10","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"C Hurkens","year":"1989","unstructured":"Hurkens C, Schrijver A (1989) On the size of systems of sets every $$t$$ of which have an SDR, with application to worst case ratio of heuristics for packing problem. SIAM J Discrete Math 2(1):68\u201372","journal-title":"SIAM J Discrete Math"},{"key":"708_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1002\/1097-0118(200104)36:4<175::AID-JGT1005>3.0.CO;2-T","volume":"36","author":"A Kaneko","year":"2001","unstructured":"Kaneko A, Kelmans A, Nishimura T (2001) On packing $$3$$-vertex paths in a graph. J Graph Theory 36:175\u2013197","journal-title":"J Graph Theory"},{"issue":"1","key":"708_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1002\/jgt.10136","volume":"45","author":"A Kelamns","year":"2003","unstructured":"Kelamns A, Mubayi D (2003) How many disjoint $$2$$-edge paths must a cubic graph have? J Graph Theory 45(1):57\u201379","journal-title":"J Graph Theory"},{"issue":"4","key":"708_CR13","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1002\/jgt.20238","volume":"55","author":"AK Kelmans","year":"2007","unstructured":"Kelmans AK (2007) Packing $$k$$-edge trees in graphs of restricted vertex degree. J Graph Theory 55(4):306\u2013323","journal-title":"J Graph Theory"},{"key":"708_CR14","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.dam.2010.05.001","volume":"159","author":"A Kelmans","year":"2011","unstructured":"Kelmans A (2011) Packing $$3$$-vertex paths in claw-free graphs and related topics. Discrete Appl Math 159:112\u2013127","journal-title":"Discrete Appl Math"},{"issue":"3","key":"708_CR15","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/0212040","volume":"12","author":"DG Kirkpatrick","year":"1983","unstructured":"Kirkpatrick DG, Hell P (1983) On the complexity of general graph factor problems. SIAM J Comput 12(3):601\u2013609","journal-title":"SIAM J Comput"},{"key":"708_CR16","doi-asserted-by":"crossref","unstructured":"Kosowski A, Malafiejski M, \u017byli\u0144ski P (2005) Packing three-vertex paths in a subcubic graph. In: 2005 European conference on combinatorics, graph theory and applications (EuroComb\u201905), Berlin, pp 213\u2013218. hal-01184370","DOI":"10.46298\/dmtcs.3413"},{"key":"708_CR17","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00373-008-0807-7","volume":"24","author":"A Kosowski","year":"2008","unstructured":"Kosowski A, Malafiejski M, \u017byli\u0144ski P (2008) Tighter bounds on the size of a maximum $$P_3$$-matching in a cubic graph. Graphs Combin 24:461\u2013468","journal-title":"Graphs Combin"},{"key":"708_CR18","first-page":"95","volume":"89","author":"A Kosowski","year":"2008","unstructured":"Kosowski A, \u017byli\u0144ski P (2008) Packing three-vertex paths in $$2$$-connected cubic graphs. Ars Combin 89:95\u2013113","journal-title":"Ars Combin"},{"key":"708_CR19","first-page":"1002","volume":"3911","author":"A Kosowski","year":"2006","unstructured":"Kosowski A, Malafiejski M, \u017byli\u0144ski P (2006) Parallel processing subsystems with redundancy in a distributed environment. LNCS 3911:1002\u20131009","journal-title":"LNCS"},{"key":"708_CR20","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1016\/j.orl.2006.12.004","volume":"35","author":"J Monnot","year":"2007","unstructured":"Monnot J, Toulouse S (2007) The path partition problem and related problems in bipartite graphs. Oper Res Lett 35:677\u2013684","journal-title":"Oper Res Lett"},{"issue":"11","key":"708_CR21","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1016\/j.ipl.2015.05.010","volume":"115","author":"B Neggazi","year":"2015","unstructured":"Neggazi B, Turau V, Haddad M (2015) A self-stabilizing algorithm for maximal $$p$$-star decomposition of general graphs. Inf Process Lett 115(11):892\u2013898","journal-title":"Inf Process Lett"},{"issue":"3","key":"708_CR22","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.tcs.2005.10.009","volume":"351","author":"E Prieto","year":"2006","unstructured":"Prieto E, Sloper C (2006) Looking at the stars. Theor Comput Sci 351(3):437\u2013445","journal-title":"Theor Comput Sci"},{"key":"708_CR23","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.ipl.2009.12.002","volume":"110","author":"J Wang","year":"2010","unstructured":"Wang J, Ning D, Feng Q, Chen J (2010) An improved kernelization for $$P_2$$-packing. Inf Process Lett 110:188\u2013192","journal-title":"Inf Process Lett"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00708-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-021-00708-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00708-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,16]],"date-time":"2022-12-16T05:15:57Z","timestamp":1671167757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-021-00708-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,9]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["708"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00708-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,9]]},"assertion":[{"value":"21 January 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}