{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T01:01:10Z","timestamp":1648774870123},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T00:00:00Z","timestamp":1288656000000},"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":[[2011,9]]},"DOI":"10.1007\/s00373-010-0991-0","type":"journal-article","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T11:54:03Z","timestamp":1288698843000},"page":"621-646","source":"Crossref","is-referenced-by-count":1,"title":["Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices"],"prefix":"10.1007","volume":"27","author":[{"given":"Dalibor","family":"Fron\u010dek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr","family":"Kov\u00e1\u0159","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kubesa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,11,2]]},"reference":[{"key":"991_CR1","unstructured":"Eldergill, P.: Decompositions of the complete graph with an even number of vertices. M.Sc. Thesis, McMaster University, Hamilton (1997)"},{"key":"991_CR2","doi-asserted-by":"crossref","first-page":"1317","DOI":"10.1016\/j.disc.2003.11.061","volume":"307","author":"D. Fron\u010dek","year":"2007","unstructured":"Fron\u010dek D.: Bi-cyclic decompositions of complete graphs into spanning trees. Discrete Math. 307, 1317\u20131322 (2007)","journal-title":"Discrete Math."},{"key":"991_CR3","first-page":"179","volume":"57","author":"D. Fron\u010dek","year":"2006","unstructured":"Fron\u010dek D.: Note on factorizations of complete graphs into caterpillars with small diameters. J. Comb. Math. Comb. Comput. 57, 179\u2013186 (2006)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"991_CR4","first-page":"125","volume":"154","author":"D. Fron\u010dek","year":"2002","unstructured":"Fron\u010dek D., Kubesa M.: Factorizations of complete graphs into spanning trees. Congr. Numerantium 154, 125\u2013134 (2002)","journal-title":"Congr. Numerantium"},{"key":"991_CR5","first-page":"33","volume":"168","author":"T. Kov\u00e1\u0159ov\u00e1","year":"2004","unstructured":"Kov\u00e1\u0159ov\u00e1 T.: Fixing labelings and factorizations of complete graphs into caterpillars with diameter four. Congr. Numerantium 168, 33\u201348 (2004)","journal-title":"Congr. Numerantium"},{"key":"991_CR6","unstructured":"Kov\u00e1\u0159ov\u00e1, T.: Spanning tree factorizations of complete graphs. Ph.D. Thesis, V\u0160B \u2013 Technical University of Ostrava (2004)"},{"key":"991_CR7","first-page":"33","volume":"52","author":"M. Kubesa","year":"2005","unstructured":"Kubesa M.: Spanning tree factorizations of complete graphs. J. Comb. Math. Comb. Comput. 52, 33\u201349 (2005)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"991_CR8","unstructured":"Kubesa, M.: Factorizations of complete graphs into caterpillars of diameter four and five. Ph.D. Thesis, V\u0160B \u2013 Technical University of Ostrava (2004)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0991-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0991-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0991-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:31Z","timestamp":1559041111000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0991-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,2]]},"references-count":8,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["991"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0991-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,2]]}}}