{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T20:53:00Z","timestamp":1772484780302,"version":"3.50.1"},"reference-count":32,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T00:00:00Z","timestamp":1769558400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001667","name":"ERCIM","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001667","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003246","name":"NWO","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1016\/j.ejc.2026.104346","type":"journal-article","created":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T07:39:49Z","timestamp":1770104389000},"page":"104346","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Path decompositions of oriented graphs"],"prefix":"10.1016","volume":"134","author":[{"given":"Viresh","family":"Patel","sequence":"first","affiliation":[]},{"given":"Mehmet Akif","family":"Y\u0131ld\u0131z","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.ejc.2026.104346_b1","first-page":"405","article-title":"Covering and packing in graphs iii: Cyclic and acyclic invariants","volume":"30","author":"Akiyama","year":"1980","journal-title":"Math. Slovaca"},{"issue":"3","key":"10.1016\/j.ejc.2026.104346_b2","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF02783300","article-title":"The linear arboricity of graphs","volume":"62","author":"Alon","year":"1988","journal-title":"Isr. J. Math."},{"issue":"1\u20133","key":"10.1016\/j.ejc.2026.104346_b3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0012-365X(92)00465-4","article-title":"Probabilistic methods in coloring and decomposition problems","volume":"127","author":"Alon","year":"1994","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/j.ejc.2026.104346_b4","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/0095-8956(76)90013-7","article-title":"Path numbers of tournaments","volume":"20","author":"Alspach","year":"1976","journal-title":"J. Combin. Theory Ser. B"},{"issue":"3","key":"10.1016\/j.ejc.2026.104346_b5","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1017\/S0004972700041101","article-title":"Path decompositions of digraphs","volume":"10","author":"Alspach","year":"1974","journal-title":"Bull. Aust. Math. Soc."},{"key":"10.1016\/j.ejc.2026.104346_b6","series-title":"Gallai\u2019s path decomposition in planar graphs","author":"Blanch\u00e9","year":"2021"},{"key":"10.1016\/j.ejc.2026.104346_b7","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0195-6698(80)80030-8","article-title":"A probabilistic proof of an asymptotic formula for the number of labelled graphs","volume":"1","author":"Bollob\u00e1s","year":"1980","journal-title":"European J. Combin."},{"key":"10.1016\/j.ejc.2026.104346_b8","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"2001"},{"key":"10.1016\/j.ejc.2026.104346_b9","doi-asserted-by":"crossref","DOI":"10.1016\/j.aim.2023.109434","article-title":"Towards the erd\u0151s-gallai cycle decomposition conjecture","volume":"437","author":"Buci\u0107","year":"2024","journal-title":"Adv. Math."},{"key":"10.1016\/j.ejc.2026.104346_b10","series-title":"New bounds for linear arboricity and related problems","author":"Christoph","year":"2025"},{"issue":"4","key":"10.1016\/j.ejc.2026.104346_b11","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1002\/rsa.20574","article-title":"Cycle packing","volume":"45","author":"Conlon","year":"2014","journal-title":"Random Structures Algorithms"},{"key":"10.1016\/j.ejc.2026.104346_b12","series-title":"Decomposing Directed Graphs Into Paths","author":"de Vos","year":"2020"},{"issue":"3","key":"10.1016\/j.ejc.2026.104346_b13","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1002\/jgt.3190100307","article-title":"What is the smallest number of dicycles in a dicycle decomposition of an Eulerian digraph?","volume":"10","author":"Dean","year":"1986","journal-title":"J. Graph Theory"},{"issue":"1\u20133","key":"10.1016\/j.ejc.2026.104346_b14","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0012-365X(99)00167-3","article-title":"Gallai\u2019s conjecture for disconnected graphs","volume":"213","author":"Dean","year":"2000","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2026.104346_b15","doi-asserted-by":"crossref","unstructured":"P. Erd\u0151s, A.W. Goodman, L. P\u00f3sa, The representation of a graph by set intersections, Canad. J. Math. 18 (1966) 106\u2013112.","DOI":"10.4153\/CJM-1966-014-3"},{"key":"10.1016\/j.ejc.2026.104346_b16","doi-asserted-by":"crossref","unstructured":"A. Gir\u00e3o, B. Granet, D. K\u00fchn, A. Lo, D. Osthus, Path decompositions of tournaments, Proc. Lond. Math. Soc. 126 (2023) 429\u2013517.","DOI":"10.1112\/plms.12480"},{"key":"10.1016\/j.ejc.2026.104346_b17","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s10114-016-5071-9","article-title":"Linear arboricity of regular digraphs","volume":"33","author":"He","year":"2017","journal-title":"Acta. Math. Sin. -English Ser."},{"key":"10.1016\/j.ejc.2026.104346_b18","unstructured":"B. Jackson, Decompositions of graphs into cycles, Regards sur la Th\u00e9orie Des Graphes 1980, 259\u2013261."},{"key":"10.1016\/j.ejc.2026.104346_b19","doi-asserted-by":"crossref","unstructured":"C. Knierim, M. Larcher, A. Martinsson, A. Noever, Long cycles, heavy cycles and cycle decompositions in digraphs, J. Combin. Theory Ser. B 148 (2021) 125\u2013148.","DOI":"10.1016\/j.jctb.2020.12.008"},{"key":"10.1016\/j.ejc.2026.104346_b20","unstructured":"A. Kotzig, Aus der Theorie der endlichen regul\u00e4ren Graphen dritten und vierten Grades, Cas. Pest. Mat 82 (1957) 76\u201392."},{"key":"10.1016\/j.ejc.2026.104346_b21","doi-asserted-by":"crossref","unstructured":"D. K\u00fchn, D. Osthus, Hamilton decompositions of regular expanders: a proof of Kelly\u2019s conjecture for large tournaments, Adv. Math. 237 (2013) 62\u2013146.","DOI":"10.1016\/j.aim.2013.01.005"},{"key":"10.1016\/j.ejc.2026.104346_b22","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/s00493-023-00024-9","article-title":"An improved bound for the linear arboricity conjecture","volume":"43","author":"Lang","year":"2023","journal-title":"Combinatorica"},{"issue":"2","key":"10.1016\/j.ejc.2026.104346_b23","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1112\/plms.12328","article-title":"Decomposing tournaments into paths","volume":"121","author":"Lo","year":"2020","journal-title":"Proc. Lond. Math. Soc."},{"key":"10.1016\/j.ejc.2026.104346_b24","series-title":"Theory of Graphs (Proc. Colloq., Tihany, 1966)","first-page":"231","article-title":"On covering of graphs","author":"Lov\u00e1sz","year":"1968"},{"key":"10.1016\/j.ejc.2026.104346_b25","series-title":"R\u00e9cr\u00e9ations math\u00e9matiques","author":"Lucas","year":"1883"},{"issue":"2","key":"10.1016\/j.ejc.2026.104346_b26","doi-asserted-by":"crossref","DOI":"10.1112\/jlms.70269","article-title":"Approximate path decompositions of regular graphs","volume":"112","author":"Montgomery","year":"2025","journal-title":"J. Lond. Math. Soc."},{"key":"10.1016\/j.ejc.2026.104346_b27","doi-asserted-by":"crossref","unstructured":"A. Nakayama, B. Peroch\u00e9, Linear arboricity of digraphs, Networks 17 (1987) 39\u201353.","DOI":"10.1002\/net.3230170104"},{"issue":"2","key":"10.1016\/j.ejc.2026.104346_b28","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/0095-8956(77)90009-0","article-title":"An upper bound on the path number of a digraph","volume":"22","author":"O\u2019Brien","year":"1977","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"10.1016\/j.ejc.2026.104346_b29","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0166-218X(84)90101-X","article-title":"NP-completeness of some problems of partitioning and covering in graphs","volume":"8","author":"Peroch\u00e9","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.ejc.2026.104346_b30","doi-asserted-by":"crossref","unstructured":"K.B. Reid, K. Wayland, Minimum path decompositions of oriented cubic graphs, J. Graph Theory 11 (1987) 113\u2013118.","DOI":"10.1002\/jgt.3190110115"},{"key":"10.1016\/j.ejc.2026.104346_b31","doi-asserted-by":"crossref","unstructured":"J.B. Shearer, On a problem of Spencer, Combinatorica 5 (1985) 241\u2013245.","DOI":"10.1007\/BF02579368"},{"key":"10.1016\/j.ejc.2026.104346_b32","series-title":"On path decompositions of graphs","author":"Yan","year":"1998"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000144?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000144?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T19:53:24Z","timestamp":1772481204000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669826000144"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":32,"alternative-id":["S0195669826000144"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104346","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Path decompositions of oriented graphs","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104346","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"104346"}}