{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T10:04:07Z","timestamp":1755597847047},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,1,14]],"date-time":"2014-01-14T00:00:00Z","timestamp":1389657600000},"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":[[2015,5]]},"DOI":"10.1007\/s00373-013-1402-0","type":"journal-article","created":{"date-parts":[[2014,1,13]],"date-time":"2014-01-13T05:29:20Z","timestamp":1389590960000},"page":"729-741","source":"Crossref","is-referenced-by-count":9,"title":["Edge Decompositions of Hypercubes by Paths and by Cycles"],"prefix":"10.1007","volume":"31","author":[{"given":"Michel","family":"Mollard","sequence":"first","affiliation":[]},{"given":"Mark","family":"Ramras","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,1,14]]},"reference":[{"key":"1402_CR1","unstructured":"Aubert, J., Schneider, B.: D\u00e9composition de la somme Cart\u00e9sienne d\u2019un cycle et de l\u2019union de deux cycles Hamiltoniens en cycles Hamiltoniens, Disc. Math. 38, 7\u201316 (1982)"},{"key":"1402_CR2","doi-asserted-by":"crossref","unstructured":"Bryant, D.E., El-Zanati, S., Eynden, C.V., Hoffman, D.G.: Star decompositions of cubes. Graphs Comb. 17(1), 55\u201359 (2001)","DOI":"10.1007\/s003730170054"},{"key":"1402_CR3","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1002\/jgt.3190140403","volume":"14","author":"J.F. Fink","year":"1990","unstructured":"Fink J.F.: On the decomposition of n-cubes into isomorphic trees. J. Graph Theory 14, 405\u2013411 (1990)","journal-title":"J. Graph Theory"},{"key":"1402_CR4","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1002\/j.1538-7305.1958.tb03887.x","volume":"37","author":"E. Gilbert","year":"1958","unstructured":"Gilbert E.: Gray codes and paths on the n-cube. Bell Syst. Tech. J. 37, 815\u2013826 (1958)","journal-title":"Bell Syst. Tech. J."},{"key":"1402_CR5","first-page":"191","volume":"2","author":"T. Kirkman","year":"1847","unstructured":"Kirkman T.: On a problem in combinatorics. Camb. Dublin Math. J. 2, 191\u2013204 (1847)","journal-title":"Camb. Dublin Math. J."},{"key":"1402_CR6","first-page":"258","volume":"5","author":"T. Kirkman","year":"1850","unstructured":"Kirkman T.: Note on an unanswered prize question. Camb. Dublin Math. J. 5, 258\u2013262 (1850)","journal-title":"Camb. Dublin Math. J."},{"key":"1402_CR7","unstructured":"Leighton, F.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, M. Kaufmann Publishers, San Mateo, California, (1992)"},{"key":"1402_CR8","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01789464","volume":"7","author":"M. Ramras","year":"1991","unstructured":"Ramras M.: Symmetric edge-decompositions of hypercubes. Graphs Comb. 7, 65\u201387 (1991)","journal-title":"Graphs Comb."},{"key":"1402_CR9","first-page":"3","volume":"46","author":"M. Ramras","year":"1997","unstructured":"Ramras M.: Fundamental subsets of edges of hypercubes. Ars Comb. 46, 3\u201324 (1997)","journal-title":"Ars Comb."},{"key":"1402_CR10","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1007\/BF02960735","volume":"20","author":"G. Ringel","year":"1955","unstructured":"Ringel G.: \"Uber drei kombinatorische probleme am n-dimensionalen W\u00fcrfel und W\u00fcrfelgitter. Abh. Math. Sem. Univ. Hamburg 20, 10\u201315 (1955)","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"1402_CR11","unstructured":"Ringel, G.: Problem 25, Theory of Graphs and its Applications. Nakl. \u010cSAN, Praha, p. 162. (1964)"},{"key":"1402_CR12","doi-asserted-by":"crossref","unstructured":"Wagner, S.; Wild, M.: Decomposing the hypercube Q n into n isomorphic edge-disjoint trees. Discret. Math. doi: 10.1016\/j.disc.2012.01.033 (2012)","DOI":"10.1016\/j.disc.2012.01.033"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1402-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-013-1402-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1402-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:37Z","timestamp":1559041177000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-013-1402-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,14]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["1402"],"URL":"https:\/\/doi.org\/10.1007\/s00373-013-1402-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,14]]}}}