{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:23:25Z","timestamp":1774369405769,"version":"3.50.1"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2008,10,1]],"date-time":"2008-10-01T00:00:00Z","timestamp":1222819200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1007\/s00373-008-0807-7","type":"journal-article","created":{"date-parts":[[2008,10,25]],"date-time":"2008-10-25T05:24:20Z","timestamp":1224912260000},"page":"461-468","source":"Crossref","is-referenced-by-count":8,"title":["Tighter Bounds on the Size of a Maximum P 3-Matching in a Cubic Graph"],"prefix":"10.1007","volume":"24","author":[{"given":"Adrian","family":"Kosowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Ma\u0142afiejski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"\u017byli\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,10,26]]},"reference":[{"key":"807_CR1","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Kano, M.: Factors and factorizations of graphs\u2014a survey. Journal of Graph Theory 9, 1\u201342 (1985)","DOI":"10.1002\/jgt.3190090103"},{"key":"807_CR2","doi-asserted-by":"crossref","unstructured":"Hell, P., Kirkpatrick, D.G.: On the complexity of general graph factor problems. SIAM Journal on Computing 12, 601\u2013609 (1983)","DOI":"10.1137\/0212040"},{"key":"807_CR3","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K., Matsuda, H., Oda, Y., Ota, K.: Path factors in cubic graphs. Journal of Graph Theory 39, 188\u2013193 (2002)","DOI":"10.1002\/jgt.10022"},{"key":"807_CR4","doi-asserted-by":"crossref","unstructured":"Kelmans, A.: Packing k-edge trees in graphs of restricted degrees. Journal of Graph Theory 55, 306\u2013324 (2007)","DOI":"10.1002\/jgt.20238"},{"key":"807_CR5","unstructured":"Kelmans, A., Mubayi, D.: How many disjoint 2-edge paths must a cubic graph have? Journal of Graph Theory 45, 57\u201379 (2004)"},{"key":"807_CR6","doi-asserted-by":"crossref","unstructured":"Kosowski, A., Ma\u0142afiejski, M., \u017byli\u0144ski, P.: An Approximation Algorithm for Maximum P 3-packing in Subcubic Graphs. Information Processing Letters 99, 230\u2013233 (2006)","DOI":"10.1016\/j.ipl.2006.05.003"},{"key":"807_CR7","unstructured":"Kosowski, A., \u017byli\u0144ski, P.: Packing three-vertex paths in 2-connected cubic graphs. To appear in: Ars Combinatoria 89 (2008)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0807-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-008-0807-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0807-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:28Z","timestamp":1559055508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-008-0807-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10]]},"references-count":7,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["807"],"URL":"https:\/\/doi.org\/10.1007\/s00373-008-0807-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10]]}}}