{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T00:45:12Z","timestamp":1777423512011,"version":"3.51.4"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,5,17]],"date-time":"2018-05-17T00:00:00Z","timestamp":1526515200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s00493-017-3661-5","type":"journal-article","created":{"date-parts":[[2018,5,17]],"date-time":"2018-05-17T04:18:13Z","timestamp":1526530693000},"page":"239-263","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Edge-Partitioning a Graph into Paths: Beyond the Bar\u00e1t-Thomassen Conjecture"],"prefix":"10.1007","volume":"39","author":[{"given":"Julien","family":"Bensmail","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ararat","family":"Harutyunyan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tien-Nam","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phan","family":"Thomass\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,17]]},"reference":[{"key":"3661_CR1","first-page":"39","volume":"124","author":"J. Bensmail","year":"2017","unstructured":"J. Bensmail, A. Harutyunyan, T.-N. Le, M. Merker and S. Thomass\u00e9: A Proof of the Bar\u00e1t-Thomassen Conjecture. Journal of Combinatorial Theory, Series B\n                           124 (2017), 39\u201355.","journal-title":"Series B"},{"key":"3661_CR2","first-page":"508","volume":"122","author":"F. Botler","year":"2017","unstructured":"F. Botler, G. O. Mota, M. Oshiro and Y. Wakabayashi: Decomposing highly edge-connected graphs into paths of any given length. Journal of Combinatorial Theory, Series B\n                           122 (2017), 508\u2013542.","journal-title":"Series B"},{"key":"3661_CR3","doi-asserted-by":"crossref","unstructured":"F. Botler, G. O. Mota, M. Oshiro and Y. Wakabayashi: Decompositions of highly connected graphs into paths of length five. Discrete Applied Mathematics, Doi: 10.1016\/j.dam.2016.08.001, 2016.","DOI":"10.1016\/j.dam.2016.08.001"},{"key":"3661_CR4","doi-asserted-by":"publisher","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. Journal of Graph Theory\n                           52 (2006), 135\u2013146.","journal-title":"Journal of Graph Theory"},{"key":"3661_CR5","first-page":"91","volume-title":"Combinatorial Algorithms","author":"J. Edmonds","year":"1973","unstructured":"J. Edmonds: Edge-disjoint branchings, Combinatorial Algorithms (B. Rustin, editor), 91\u201396, Academic Press, 1973."},{"key":"3661_CR6","first-page":"191","volume":"187","author":"B. Jackson","year":"1993","unstructured":"B. Jackson: On circuit covers, circuit decompositions and Euler tours of graph, Surveys in Combinatorics, London Mathematical Society Lecture Note Series,\n                           187 (1993), 191\u2013210.","journal-title":"London Mathematical Society Lecture Note Series"},{"key":"3661_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1017\/S0963548301005089","volume":"11","author":"C. McDiarmid","year":"2002","unstructured":"C. McDiarmid: Concentration for Independent Permutations. Combinatorics, Probability and Computing\n                           11 (2002), 163\u2013178.","journal-title":"Probability and Computing"},{"key":"3661_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04016-0","volume-title":"Graph Colouring and the Probabilistic Method","author":"M. Molloy","year":"2002","unstructured":"M. Molloy and B. Reed: Graph Colouring and the Probabilistic Method. Springer, 2002."},{"key":"3661_CR9","first-page":"555","volume":"12","author":"C. St. J. A. Nash-Williams","year":"1960","unstructured":"C. St. J. A. Nash-Williams: On orientations, connectivity and odd-vertex-pairings in finite graphs. Canadian Journal of Mathematics\n                           12 (1960), 555\u2013567.","journal-title":"connectivity and odd-vertex-pairings in finite graphs. Canadian Journal of Mathematics"},{"key":"3661_CR10","volume-title":"Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture","author":"M. Stiebitz","year":"2012","unstructured":"M. Stiebitz, D. Scheide, B. Toft and L. M. Favrholdt: Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture, Wiley, 2012."},{"key":"3661_CR11","doi-asserted-by":"publisher","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. Journal of Graph Theory\n                           58 (2008), 286\u2013292.","journal-title":"Journal of Graph Theory"},{"key":"3661_CR12","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s12188-008-0002-z","volume":"18","author":"C. Thomassen","year":"2008","unstructured":"C. Thomassen: Edge-decompositions of highly connected graphs. Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg\n                           18 (2008), 17\u201326.","journal-title":"Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg"},{"key":"3661_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s00493-013-2633-7","volume":"33","author":"C. Thomassen","year":"2013","unstructured":"C. Thomassen: Decomposing graphs into paths of fixed length. Combinatorica\n                           33 (2013), 97\u2013123.","journal-title":"Combinatorica"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-017-3661-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-017-3661-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-017-3661-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T16:10:09Z","timestamp":1560442209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-017-3661-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,17]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["3661"],"URL":"https:\/\/doi.org\/10.1007\/s00493-017-3661-5","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,17]]},"assertion":[{"value":"30 June 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}