{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T16:50:10Z","timestamp":1648745410965},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,2,23]],"date-time":"2010-02-23T00:00:00Z","timestamp":1266883200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s00373-010-0904-2","type":"journal-article","created":{"date-parts":[[2010,2,22]],"date-time":"2010-02-22T05:00:35Z","timestamp":1266814835000},"page":"207-214","source":"Crossref","is-referenced-by-count":0,"title":["Edge-disjoint Open Trails in Complete Bipartite Multigraphs"],"prefix":"10.1007","volume":"26","author":[{"given":"Sylwia","family":"Cichacz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Agnieszka","family":"G\u00f6rlich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,23]]},"reference":[{"key":"904_CR1","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1017\/S0963548301004771","volume":"10","author":"P.N. Balister","year":"2001","unstructured":"Balister P.N.: Packing Circuits into K n . Combin. Probab. Comput. 10, 463\u2013499 (2001)","journal-title":"Combin. Probab. Comput."},{"key":"904_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0963548302005461","volume":"12","author":"P.N. Balister","year":"2003","unstructured":"Balister P.N.: Packing digraphs with with directed closed trails. Combin. Probab. Comput. 12, 1\u201315 (2003)","journal-title":"Combin. Probab. Comput."},{"issue":"2","key":"904_CR3","doi-asserted-by":"crossref","first-page":"241","DOI":"10.7151\/dmgt.1358","volume":"27","author":"S. Cichacz","year":"2007","unstructured":"Cichacz S.: Decomposition of complete bipartite digraphs and even complete bipartite multigraphs into closed trails. Discuss. Math. Graph Theory 27(2), 241\u2013249 (2007)","journal-title":"Discuss. Math. Graph Theory"},{"key":"904_CR4","doi-asserted-by":"crossref","first-page":"1511","DOI":"10.1016\/j.disc.2008.03.004","volume":"309","author":"S. Cichacz","year":"2009","unstructured":"Cichacz S., Egawa Y., Wo\u017aniak M.: Arbitrary decomposition into open and closed trails. Discrete Math. 309, 1511\u20131516 (2009)","journal-title":"Discrete Math."},{"key":"904_CR5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.endm.2006.06.009","volume":"24","author":"S. Cichacz","year":"2006","unstructured":"Cichacz S., G\u00f6rlich A.: Decomposition of complete bipartite graphs into open trails. Electron. Notes Discrete Math. 24, 53\u201355 (2006)","journal-title":"Electron. Notes Discrete Math."},{"key":"904_CR6","unstructured":"Cichacz, S., G\u00f6rlich, A.: The open trails in digraphs. Preprint MD 025, http:\/\/www.ii.uj.edu.pl\/preMD\/ (2007)"},{"key":"904_CR7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1022931710349","volume":"128","author":"M. Hor\u0148\u00e1k","year":"2003","unstructured":"Hor\u0148\u00e1k M., Wo\u017aniak M.: Decomposition of complete bipartite even graphs into closed trails. Czech. Math. J. 128, 127\u2013134 (2003)","journal-title":"Czech. Math. J."},{"key":"904_CR8","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J. Petersen","year":"1891","unstructured":"Petersen J.: Die Theorie der regularen Graphen. Acta Math. 15, 193\u2013220 (1891)","journal-title":"Acta Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0904-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0904-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0904-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:30Z","timestamp":1559055510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0904-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,23]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["904"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0904-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,23]]}}}