{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:41Z","timestamp":1759063601897},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,2,1]],"date-time":"2013-02-01T00:00:00Z","timestamp":1359676800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s00493-013-2633-7","type":"journal-article","created":{"date-parts":[[2013,6,22]],"date-time":"2013-06-22T09:46:53Z","timestamp":1371894413000},"page":"97-123","source":"Crossref","is-referenced-by-count":17,"title":["Decomposing graphs into paths of fixed length"],"prefix":"10.1007","volume":"33","author":[{"given":"Carsten","family":"Thomassen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,6,23]]},"reference":[{"key":"2633_CR1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1002\/jgt.10092","volume":"42","author":"J Bang-Jensen","year":"2003","unstructured":"J. Bang-Jensen, S. Thomass\u00e9 and A. Yeo: Small degree out-branchings, J. Graph Theory 42 (2003), 297\u2013307.","journal-title":"J. Graph Theory"},{"key":"2633_CR2","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/jgt.20149","volume":"52","author":"J Bar\u00e1t","year":"2006","unstructured":"J. Bar\u00e1t and C. Thomassen: Claw-decompositions and Tutte-orientations, J. Graph Theory 52 (2006), 135\u2013146.","journal-title":"J. Graph Theory"},{"key":"2633_CR3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1002\/jgt.3190140213","volume":"14","author":"J A Bondy","year":"1990","unstructured":"J. A. Bondy: Double covers of graphs, J. Graph Theory 14 (1990), 259\u2013273.","journal-title":"J. Graph Theory"},{"key":"2633_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J A Bondy","year":"1976","unstructured":"J. A. Bondy and U. S. R. Murty: Graph Theory with Applications, The MacMillan Press Ltd. (1976)."},{"key":"2633_CR5","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-63397-9_9","volume":"1284","author":"A Czumaj","year":"1997","unstructured":"A. Czumaj and W. B. Strothmann: Bounded degree spanning trees, In: Algorithms-ESA 97 (Graz), Springer lecture notes in computer science 1284 (1997), 104\u2013117.","journal-title":"Algorithms-ESA 97 (Graz), Springer lecture notes in computer science"},{"key":"2633_CR6","volume-title":"Graph Theory, Springer Verlag","author":"R Diestel","year":"1997","unstructured":"R. Diestel: Graph Theory, Springer Verlag (1997) and 2nd edition (2000)."},{"key":"2633_CR7","doi-asserted-by":"crossref","first-page":"1166","DOI":"10.1137\/S0097539792229507","volume":"26","author":"D Dor","year":"1997","unstructured":"D. Dor and M. Tarsi: Graph decomposition is NP-complete: a complete proof of Holyer\u2019s conjecture, SIAM J. Comput. 26 (1997), 1166\u20131187.","journal-title":"SIAM J. Comput."},{"key":"2633_CR8","doi-asserted-by":"crossref","first-page":"67","DOI":"10.6028\/jres.069B.004","volume":"69B","author":"J Edmonds","year":"1965","unstructured":"J. Edmonds: Minimum partition of a matroid into independent subsets, J. Res. Nat. Bur. Standards Sect. B 69B (1965), 67\u201372.","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"2633_CR9","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/(SICI)1097-0118(199906)31:2<135::AID-JGT6>3.0.CO;2-I","volume":"31","author":"K Heinrich","year":"1999","unstructured":"K. Heinrich, J. Liu and M. Yu: P 4-decompositions of regular graphs, J. Graph Theory 31 (1999), 135\u2013143.","journal-title":"J. Graph Theory"},{"key":"2633_CR10","first-page":"71","volume-title":"Selected Topics in Graph Theory 3","author":"F Jaeger","year":"1988","unstructured":"F. Jaeger: Nowhere-zero flow problems, In: Selected Topics in Graph Theory 3 edited by L. W. Beineke and R. J. Wilson, Academic Press (1988) 71\u201395."},{"key":"2633_CR11","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1002\/jgt.3190090416","volume":"9","author":"M J\u00fcnger","year":"1985","unstructured":"M. J\u00fcnger, G. Reinelt and W. Pulleyblank: On partitioning the edges of graphs into connected subgraphs, J. Graph Theory 9 (1985), 539\u2013549.","journal-title":"J. Graph Theory"},{"key":"2633_CR12","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s00493-004-0010-2","volume":"24","author":"D K\u00fchn","year":"2004","unstructured":"D. K\u00fchn and D. Osthus: Every graph of sufficiently large average degree contains a C 4-free subgraph of large average degree, Combinatorica 24 (2004), 155\u2013162.","journal-title":"Combinatorica"},{"key":"2633_CR13","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01902503","volume":"28","author":"L Lov\u00e1sz","year":"1976","unstructured":"L. Lov\u00e1sz: On some connectivity properties of eulerian graphs, Acta Math. Acad. Sci. Hung. 28 (1976), 129\u2013138.","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"2633_CR14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0167-5060(08)70504-1","volume":"3","author":"W Mader","year":"1978","unstructured":"W. Mader: A reduction method for edge-connectivity in graphs, Ann. Discrete Math. 3 (1978), 145\u2013164.","journal-title":"Ann. Discrete Math."},{"key":"2633_CR15","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on Surfaces","author":"B Mohar","year":"2001","unstructured":"B. Mohar and C. Thomassen: Graphs on Surfaces, Johns Hopkins University Press (2001)."},{"key":"2633_CR16","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"C St J A Nash-Williams","year":"1961","unstructured":"C. St. J. A. Nash-Williams: Edge-disjoint spanning trees of finite graphs, J. London Math. Soc. 36 (1961), 445\u2013450.","journal-title":"J. London Math. Soc."},{"key":"2633_CR17","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/jgt.3190070215","volume":"7","author":"C Thomassen","year":"1983","unstructured":"C. Thomassen: Graph decomposition with applications to subdivisions and path systems modulo k, J. Graph Theory 7 (1983), 261\u2013271.","journal-title":"J. Graph Theory"},{"key":"2633_CR18","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0095-8956(83)90067-9","volume":"35","author":"C Thomassen","year":"1983","unstructured":"C. Thomassen: Girth in graphs, J. Combinatorial Theory, Ser. B 35 (1983), 129\u2013141.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"2633_CR19","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s12188-008-0002-z","volume":"78","author":"C Thomassen","year":"2008","unstructured":"C. Thomassen: Decompositions of highly connected graphs into paths of length 4, Abh. Math. Seminar Hamburg 78 (2008), 17\u201326.","journal-title":"Abh. Math. Seminar Hamburg"},{"key":"2633_CR20","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1002\/jgt.20311","volume":"58","author":"C Thomassen","year":"2008","unstructured":"C. Thomassen: Decompositions of highly connected graphs into paths of length 3, J. Graph Theory 58 (2008), 286\u2013292.","journal-title":"J. Graph Theory"},{"key":"2633_CR21","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/j.jctb.2011.09.003","volume":"102","author":"C Thomassen","year":"2012","unstructured":"C. Thomassen: The weak 3-flow conjecture and the weak circular flow conjecture, J. Combinatorial Theory Ser.B 102 (2012), 521\u2013529.","journal-title":"J. Combinatorial Theory Ser.B"},{"key":"2633_CR22","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"36","author":"W T Tutte","year":"1961","unstructured":"W. T. Tutte: On the problem of decomposing a graph into n connected factors, J. London Math. Soc. 36 (1961), 221\u2013230.","journal-title":"J. London Math. Soc."},{"key":"2633_CR23","volume-title":"Matroid Theory","author":"D J A Welsh","year":"1976","unstructured":"D. J. A. Welsh: Matroid Theory, Academic Press (1976)."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-013-2633-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-013-2633-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-013-2633-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,2]],"date-time":"2023-07-02T14:39:50Z","timestamp":1688308790000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-013-2633-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["2633"],"URL":"https:\/\/doi.org\/10.1007\/s00493-013-2633-7","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2]]}}}