{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T05:46:26Z","timestamp":1648964786285},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,4,1]],"date-time":"2007-04-01T00:00:00Z","timestamp":1175385600000},"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":[[2007,4]]},"DOI":"10.1007\/s00373-007-0693-4","type":"journal-article","created":{"date-parts":[[2007,4,18]],"date-time":"2007-04-18T07:06:11Z","timestamp":1176879971000},"page":"145-163","source":"Crossref","is-referenced-by-count":0,"title":["Orthogonal Double Covers of Complete Graphs by Caterpillars of Diameter 5"],"prefix":"10.1007","volume":"23","author":[{"given":"Dalibor","family":"Froncek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"693_CR1","unstructured":"Froncek, D.: Orthogonal double covers of complete graphs by lobsters of diameter 4. Congr. Numer. 177, 25\u201332 (2005)"},{"key":"693_CR2","doi-asserted-by":"crossref","unstructured":"Gronau, H.-D.O.F., Gr\u00fcttm\u00fcller, M., Hartmann, S., Leck, U., Leck, V.: On orthogonal double covers of graphs, Des. Codes Cryptogr. 27, 49\u201391 (2002)","DOI":"10.1023\/A:1016546402248"},{"key":"693_CR3","unstructured":"Gronau, H.-D.O.F., Mullin, R.C., Rosa, A.: Orthogonal double covers of complete graphs by trees, Graphs Combin. 13, 251\u2013262 (1997)"},{"key":"693_CR4","unstructured":"Leck, U., Leck, V.: On orthogonal double covers by trees, J. Combin. Des. 5, 433\u2013441 (1997)"},{"key":"693_CR5","unstructured":"Leck, U., Leck, V.: Orthogonal double covers of complete graphs by trees of small diameter, Discrete Appl. Math. 95, 377\u2013388 (1999)"},{"key":"693_CR6","unstructured":"Meszka, M.: Personal communication"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0693-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-007-0693-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0693-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:26Z","timestamp":1559041106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-007-0693-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,4]]}},"alternative-id":["693"],"URL":"https:\/\/doi.org\/10.1007\/s00373-007-0693-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,4]]}}}