{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T21:26:54Z","timestamp":1770326814846,"version":"3.49.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T00:00:00Z","timestamp":1510617600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s10878-017-0200-7","type":"journal-article","created":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T11:30:22Z","timestamp":1510659022000},"page":"684-702","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Minimal path decomposition of complete bipartite graphs"],"prefix":"10.1007","volume":"35","author":[{"given":"Costas K.","family":"Constantinou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georgios","family":"Ellinas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,14]]},"reference":[{"key":"200_CR1","first-page":"7","volume":"52","author":"B Alspach","year":"2008","unstructured":"Alspach B (2008) The wonderful Walecki construction. Bull Inst Combin Appl 52:7\u201320","journal-title":"Bull Inst Combin Appl"},{"issue":"2","key":"200_CR2","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.jctb.2009.08.004","volume":"100","author":"D Bryant","year":"2010","unstructured":"Bryant D (2010) Packing paths in complete graphs. J Comb Theory Ser B 100(2):206\u2013215. \n                        https:\/\/doi.org\/10.1016\/j.jctb.2009.08.004","journal-title":"J Comb Theory Ser B"},{"issue":"13","key":"200_CR3","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0012-365X(99)00167-3","volume":"213","author":"N Dean","year":"2000","unstructured":"Dean N, Kouider M (2000) Gallai\u2019s conjecture for disconnected graphs. Discrete Math 213(13):43\u201354. \n                        https:\/\/doi.org\/10.1016\/S0012-365X(99)00167-3","journal-title":"Discrete Math"},{"issue":"2","key":"200_CR4","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1002\/jgt.3190040207","volume":"4","author":"A Donald","year":"1980","unstructured":"Donald A (1980) An upper bound for the path number of a graph. J Graph Theory 4(2):189\u2013201. \n                        https:\/\/doi.org\/10.1002\/jgt.3190040207","journal-title":"J Graph Theory"},{"issue":"2","key":"200_CR5","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.jctb.2004.09.008","volume":"93","author":"G Fan","year":"2005","unstructured":"Fan G (2005) Path decompositions and Gallai\u2019s conjecture. J Comb Theory Ser B 93(2):117\u2013125. \n                        https:\/\/doi.org\/10.1016\/j.jctb.2004.09.008","journal-title":"J Comb Theory Ser B"},{"issue":"13","key":"200_CR6","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.disc.2003.11.017","volume":"283","author":"R Haggkvist","year":"2004","unstructured":"Haggkvist R, Johansson R (2004) A note on edge-decompositions of planar graphs. Discrete Math 283(13):263\u2013266. \n                        https:\/\/doi.org\/10.1016\/j.disc.2003.11.017","journal-title":"Discrete Math"},{"issue":"3","key":"200_CR7","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1002\/jgt.21735","volume":"75","author":"P Harding","year":"2014","unstructured":"Harding P, McGuinness S (2014) Gallai\u2019s conjecture for graphs of girth at least four. J Graph Theory 75(3):256\u2013274. \n                        https:\/\/doi.org\/10.1002\/jgt.21735","journal-title":"J Graph Theory"},{"issue":"2","key":"200_CR8","first-page":"241","volume":"47","author":"K Heinrich","year":"1992","unstructured":"Heinrich K (1992) Path-decompositions. Le Matematiche 47(2):241\u2013258","journal-title":"Le Matematiche"},{"key":"200_CR9","first-page":"231","volume-title":"Theory of graphs","author":"L Lovasz","year":"1968","unstructured":"Lovasz L (1968) On covering of graphs. In: Erdos P, Katona G (eds) Theory of graphs. Academic Press, New York, pp 231\u2013236"},{"key":"200_CR10","unstructured":"Parker C (1998) Complete bipartite graph path decompositions. Ph.D. Thesis, Auburn University, Alabama"},{"issue":"1","key":"200_CR11","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1006\/jctb.1996.0012","volume":"66","author":"L Pyber","year":"1996","unstructured":"Pyber L (1996) Covering the edges of a connected graph by paths. J Comb Theory Ser B 66(1):152\u2013159. \n                        https:\/\/doi.org\/10.1006\/jctb.1996.0012","journal-title":"J Comb Theory Ser B"},{"issue":"1","key":"200_CR12","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/0097-3165(83)90040-7","volume":"34","author":"M Tarsi","year":"1983","unstructured":"Tarsi M (1983) Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs. J Comb Theory Ser A 34(1):60\u201370. \n                        https:\/\/doi.org\/10.1016\/0097-3165(83)90040-7","journal-title":"J Comb Theory Ser A"},{"issue":"4","key":"200_CR13","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1002\/jgt.20311","volume":"58","author":"C Thomassen","year":"2008","unstructured":"Thomassen C (2008) Decompositions of highly connected graphs into paths of length 3. J Graph Theory 58(4):286\u2013292. \n                        https:\/\/doi.org\/10.1002\/jgt.20311","journal-title":"J Graph Theory"},{"issue":"1","key":"200_CR14","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s12188-008-0002-z","volume":"78","author":"C Thomassen","year":"2008","unstructured":"Thomassen C (2008) Edge-decompositions of highly connected graphs into paths. Abhandlungen aus dem Mathematischen Seminar der Universitt Hamburg 78(1):17\u201326. \n                        https:\/\/doi.org\/10.1007\/s12188-008-0002-z","journal-title":"Abhandlungen aus dem Mathematischen Seminar der Universitt Hamburg"},{"issue":"1","key":"200_CR15","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0012-365X(85)80023-6","volume":"55","author":"M Truszczyski","year":"1985","unstructured":"Truszczyski M (1985) Note on the decomposition of \n                        $$\\lambda {K}_{m,n}$$\n                        \n                            \n                                \n                                    \u03bb\n                                    \n                                        K\n                                        \n                                            m\n                                            ,\n                                            n\n                                        \n                                    \n                                \n                            \n                        \n                     (\n                        $$\\lambda {K}_{m,n^*}$$\n                        \n                            \n                                \n                                    \u03bb\n                                    \n                                        K\n                                        \n                                            m\n                                            ,\n                                            \n                                                n\n                                                \u2217\n                                            \n                                        \n                                    \n                                \n                            \n                        \n                    ) into paths. Discrete Math 55(1):89\u201396. \n                        https:\/\/doi.org\/10.1016\/S0012-365X(85)80023-6","journal-title":"Discrete Math"},{"issue":"4","key":"200_CR16","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/s10255-006-0337-0","volume":"22","author":"MQ Zhai","year":"2006","unstructured":"Zhai MQ, Lu CH (2006) Path decomposition of graphs with given path length. Acta Math Appl Sin 22(4):633\u2013638. \n                        https:\/\/doi.org\/10.1007\/s10255-006-0337-0","journal-title":"Acta Math Appl Sin"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0200-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0200-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0200-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,16]],"date-time":"2018-03-16T01:19:59Z","timestamp":1521163199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0200-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,14]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["200"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0200-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,14]]}}}