{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T10:51:33Z","timestamp":1769251893248,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,5,18]],"date-time":"2024-05-18T00:00:00Z","timestamp":1715990400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,18]],"date-time":"2024-05-18T00:00:00Z","timestamp":1715990400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","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":[[2024,7]]},"DOI":"10.1007\/s10878-024-01115-z","type":"journal-article","created":{"date-parts":[[2024,5,18]],"date-time":"2024-05-18T18:01:32Z","timestamp":1716055292000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The maximum 3-star packing problem in claw-free cubic graphs"],"prefix":"10.1007","volume":"47","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":[[2024,5,18]]},"reference":[{"key":"1115_CR1","unstructured":"Akiyama J, Kano M (1984) Path factors of a graph, Graphs and applications. In: Proc. 1st Colorado Sympo. on Graph Theory. Wiley, New York"},{"key":"1115_CR2","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/j.ipl.2016.01.007","volume":"116","author":"F Barbero","year":"2016","unstructured":"Barbero F, Gutin G, Jones M, Sheng B, Yeo A (2016) Linear-vertex kernel for the problem of packing $$r$$-stars into a graph without long induced paths. Inf Process Lett 116:433\u2013436","journal-title":"Inf Process Lett"},{"issue":"7","key":"1115_CR3","doi-asserted-by":"publisher","first-page":"1396","DOI":"10.1016\/j.dam.2008.10.017","volume":"157","author":"F Chataigner","year":"2009","unstructured":"Chataigner F, Mani\u0107 G, Yuster R, Wakabayashi Y (2009) Approximation algorithms and hardness results for the clique packing problem. Discret Appl Math 157(7):1396\u20131406","journal-title":"Discret Appl Math"},{"key":"1115_CR4","first-page":"519","volume":"9","author":"A Gusakov","year":"2011","unstructured":"Gusakov A, Babenko M (2011) New exact and approximation algorithms for the star packing problem in undirected graphs. Leibniz Int Proc Inf LIPIcs 9:519\u2013530","journal-title":"Leibniz Int Proc Inf LIPIcs"},{"issue":"4","key":"1115_CR5","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1002\/jgt.20161","volume":"52","author":"D Hartvigsen","year":"2006","unstructured":"Hartvigsen D, Hell P, Szab\u00f3 J (2006) The $$k$$-piece packing problem. J Graph Theory 52(4):267\u2013293","journal-title":"J Graph Theory"},{"issue":"1","key":"1115_CR6","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. Discret Math 49(1):45\u201359","journal-title":"Discret Math"},{"issue":"2","key":"1115_CR7","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1137\/0607024","volume":"7","author":"P Hell","year":"1986","unstructured":"Hell P, Kirkpatrick DG (1986) Packings by complete bipartite graphs. SIAM J Algebraic Discrete Methods 7(2):199\u2013209","journal-title":"SIAM J Algebraic Discrete Methods"},{"key":"1115_CR8","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":"1115_CR9","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1002\/jgt.10136","volume":"45","author":"A Kelmans","year":"2004","unstructured":"Kelmans A, Mubayi D (2004) How many disjoint $$2$$-edge paths must a cubic graph have? J Graph Theory 45(1):57\u201379","journal-title":"J Graph Theory"},{"issue":"2\u20133","key":"1115_CR10","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. Discret Appl Math 159(2\u20133):112\u2013127","journal-title":"Discret Appl Math"},{"issue":"3","key":"1115_CR11","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":"1115_CR12","first-page":"65","volume":"143","author":"MC Kong","year":"2000","unstructured":"Kong MC, Zhao Y (2000) Computing $$k$$-independent sets for regular bipartite graphs. Congr Numer 143:65\u201380","journal-title":"Congr Numer"},{"key":"1115_CR13","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00373-008-0807-7","volume":"24","author":"A Kosowski","year":"2008","unstructured":"Kosowski A, Ma\u0142afiejski 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":"1115_CR14","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 Combinat 89:95\u2013113","journal-title":"Ars Combinat"},{"key":"1115_CR15","doi-asserted-by":"publisher","first-page":"1002","DOI":"10.1007\/11752578_121","volume":"3911","author":"A Kosowski","year":"2005","unstructured":"Kosowski A, Ma\u0142afiejski M, \u017byli\u0144ski P (2005) Parallel processing subsystems with redundancy in a distributed environment. Parallel Process Appl Math 3911:1002\u20131009","journal-title":"Parallel Process Appl Math"},{"key":"1115_CR16","doi-asserted-by":"crossref","unstructured":"Kosowski A, Ma\u0142afiejski 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), 2005, Berlin, Germany, pp 213\u2013218","DOI":"10.46298\/dmtcs.3413"},{"key":"1115_CR17","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1006\/jctb.1993.1058","volume":"59","author":"M Loebl","year":"1993","unstructured":"Loebl M, Poljak S (1993) Efficient subgraph packing. J Comb Theory Ser B 59:106\u2013121","journal-title":"J Comb Theory Ser B"},{"key":"1115_CR18","doi-asserted-by":"crossref","unstructured":"Miyano E, Eto H, Ito T, Liu Z (2016) Approximability of the distance independent set problem on regular graphs and planar graphs, In: 10th Annual international conference on combinatorial optimization and applications, Lecture notes in computer science, vol 10043, pp 270\u2013284","DOI":"10.1007\/978-3-319-48749-6_20"},{"key":"1115_CR19","doi-asserted-by":"crossref","unstructured":"Miyano E, Eto H, Ito T, Liu Z (2017) Approximation algorithm for the distance-$$3$$ independent set problem on cubic graphs. In: WALCOM: Algorithms and computation: 11th international conference and workshops, WALCOM 2017, Hsinchu, Taiwan, Mar 29\u201331, 2017, Proceedings, pp 228\u2013240","DOI":"10.1007\/978-3-319-53925-6_18"},{"key":"1115_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"},{"key":"1115_CR21","first-page":"195","volume":"92","author":"AA Mutairi","year":"2015","unstructured":"Mutairi AA, Ali B, Manuel P (2015) Packing in carbon nanotubes. J Comb Math Comb Comput 92:195\u2013206","journal-title":"J Comb Math Comb Comput"},{"key":"1115_CR22","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.dam.2012.08.026","volume":"168","author":"D Paulusma","year":"2014","unstructured":"Paulusma D, Chalopin J (2014) Packing bipartite graphs with covers of complete bipartite graphs. Discret Appl Math 168:40\u201350","journal-title":"Discret Appl Math"},{"key":"1115_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0020-0190(97)00223-8","volume":"65","author":"V Raman","year":"1998","unstructured":"Raman V, Ravikumar B, Srinivasa Rao S (1998) A simplified NP-complete MAXSAT problem. Inf Process Lett 65:1\u20136","journal-title":"Inf Process Lett"},{"key":"1115_CR24","doi-asserted-by":"crossref","unstructured":"Reed B, Kawarabayashi K (2010) Odd cycle packing.3 In: Proceedings of the 42nd ACM symposium on theory of computing (STOC 2010), New York, USA. ACM, pp 695\u2013704","DOI":"10.1145\/1806689.1806785"},{"issue":"1","key":"1115_CR25","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"A Schrijven","year":"1989","unstructured":"Schrijven A, Hurkens C (1989) On the size of systems of sets every $$t$$ of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM J Discret Math 2(1):68\u201372","journal-title":"SIAM J Discret Math"},{"issue":"3","key":"1115_CR26","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/s10878-021-00708-2","volume":"41","author":"W Xi","year":"2021","unstructured":"Xi W, Lin W (2021) On maximum $$P_3$$-packing in claw-free subcubic graphs. J Comb Optim 41(3):694\u2013709","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01115-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01115-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01115-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T14:39:17Z","timestamp":1721659157000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01115-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,18]]},"references-count":26,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["1115"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01115-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,18]]},"assertion":[{"value":"21 February 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"73"}}