{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:01:40Z","timestamp":1725879700055},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319530062"},{"type":"electronic","value":"9783319530079"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53007-9_15","type":"book-chapter","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T05:13:23Z","timestamp":1486012403000},"page":"166-176","source":"Crossref","is-referenced-by-count":0,"title":["Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two"],"prefix":"10.1007","author":[{"given":"Ajit A.","family":"Diwan","sequence":"first","affiliation":[]},{"given":"Sai","family":"Sandeep","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,26]]},"reference":[{"key":"15_CR1","unstructured":"Alspach, B.: The Oberwolfach problem. In: The CRC Handbook of Combinatorial Designs, pp. 394\u2013395. CRC Press, Boca Raton (1996)"},{"key":"15_CR2","doi-asserted-by":"crossref","first-page":"1294","DOI":"10.1016\/j.disc.2008.01.054","volume":"309","author":"K Brys","year":"2009","unstructured":"Brys, K., Lonc, Z.: Polynomial cases of graph decomposition: a complete solution of Holyers problem. Discrete Math. 309, 1294\u20131326 (2009)","journal-title":"Discrete Math."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Diwan, A.A.: $${P_3}$$ P 3 -decomposition of directed graphs. Discrete Appl. Math. (to appear). http:\/\/dx.doi.org\/10.1016\/j.dam.2016.01.039","DOI":"10.1016\/j.dam.2016.01.039"},{"key":"15_CR4","doi-asserted-by":"crossref","first-page":"1166","DOI":"10.1137\/S0097539792229507","volume":"26","author":"D Dor","year":"1997","unstructured":"Dor, D., Tarsi, M.: Graph decomposition is NP-complete: a complete proof of Holyers conjecture. SIAM J. Comput. 26, 1166\u20131187 (1997)","journal-title":"SIAM J. Comput."},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. J. Res. Natl. Bureau Stan. Sect. B 69, 125\u2013130 (1965)","journal-title":"J. Res. Natl. Bureau Stan. Sect. B"},{"key":"15_CR6","unstructured":"Gyarfas, A., Lehel, J.: Packing trees of different order into $$K_n$$ K n . In: Combinatorics (Proceedings of Fifth Hungarian Colloquium, Keszthely, 1976), vols. I, 18, Colloquium Mathematical Society, Janos Bolyai, pp. 463\u2013469. North-Holland, Amsterdam (1978)"},{"key":"15_CR7","doi-asserted-by":"crossref","first-page":"166","DOI":"10.4153\/CJM-1965-016-2","volume":"17","author":"DJ Fulkerson","year":"1965","unstructured":"Fulkerson, D.J., Hoffman, A.J., McAndrew, M.H.: Some properties of graphs with multiple edges. Can. J. Math. 17, 166\u2013177 (1965)","journal-title":"Can. J. Math."},{"issue":"3","key":"15_CR8","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1006\/jagm.1994.1044","volume":"17","author":"V King","year":"1994","unstructured":"King, V., Rao, S., Tarjan, R.: A faster deterministic maximum flow algorithm. J. Algorithms 17(3), 447\u2013474 (1994)","journal-title":"J. Algorithms"},{"key":"15_CR9","doi-asserted-by":"crossref","first-page":"76","DOI":"10.21136\/CPM.1957.117236","volume":"82","author":"A Kotzig","year":"1957","unstructured":"Kotzig, A.: From the theory of finite regular graphs of degree three and four. Casopis. Pest. Mat. 82, 76\u201392 (1957)","journal-title":"Casopis. Pest. Mat."},{"key":"15_CR10","doi-asserted-by":"crossref","first-page":"225","DOI":"10.7151\/dmgt.1078","volume":"18","author":"M Kouider","year":"1998","unstructured":"Kouider, M., Maheo, M., Brys, K., Lonc, Z.: Decomposition of multigraphs. Discuss. Math. Graph Theor. 18, 225\u2013232 (1998)","journal-title":"Discuss. Math. Graph Theor."},{"key":"15_CR11","unstructured":"Ringel, G.: Problem 25. In: Theory of Graphs and its Applications, Proceedings of International Symposium Smolenice 1963 Nakl, CSAV, Praha, p. 162 (1964)"},{"key":"15_CR12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","volume":"22","author":"WT Tutte","year":"1947","unstructured":"Tutte, W.T.: The factorisation of linear graphs. J. Lond. Math. Soc. 22, 107\u2013111 (1947)","journal-title":"J. Lond. Math. Soc."},{"key":"15_CR13","unstructured":"Wilson, R.M.: Decompositions of complete graphs into subgraphs isomorphic to a given graph. In: Proceedings of British Combinatorial Conference, pp. 647\u2013659 (1975)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53007-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T09:01:21Z","timestamp":1601542881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53007-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319530062","9783319530079"],"references-count":13,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-319-53007-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}
