{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:40:31Z","timestamp":1725896431213},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102165"},{"type":"electronic","value":"9783642102172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10217-2_15","type":"book-chapter","created":{"date-parts":[[2009,11,9]],"date-time":"2009-11-09T15:52:03Z","timestamp":1257781923000},"page":"125-133","source":"Crossref","is-referenced-by-count":2,"title":["Note on Decomposition of K n,n into (0,j)-prisms"],"prefix":"10.1007","author":[{"given":"Sylwia","family":"Cichacz","sequence":"first","affiliation":[]},{"given":"Dalibor","family":"Fron\u010dek","sequence":"additional","affiliation":[]},{"given":"Petr","family":"Kov\u00e1\u0159","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","first-page":"293","volume":"5","author":"J.C. Bermond","year":"1978","unstructured":"Bermond, J.C., Huang, C., Sotteau, D.: Balanced cycle and circuit designs: Even case. Ars. Combinat.\u00a05, 293\u2013318 (1978)","journal-title":"Ars. Combinat."},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1016\/j.ipl.2009.04.024","volume":"109","author":"S. Cichacz","year":"2009","unstructured":"Cichacz, S., Fron\u010dek, D.: Factorization of K\n                  \n                    n,n\n                   into (0,j)-prisms. Information Processing Letters\u00a0109, 932\u2013934 (2009)","journal-title":"Information Processing Letters"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/(SICI)1520-6610(1996)4:1<51::AID-JCD5>3.0.CO;2-Z","volume":"4","author":"S.I. El-Zanati","year":"1996","unstructured":"El-Zanati, S.I., Vanden Eynden, C.: Decompositions of K\n                  \n                    m,n\n                   into cubes. J. Comb. Designs\u00a04, 51\u201357 (1996)","journal-title":"J. Comb. Designs"},{"key":"15_CR4","first-page":"201","volume":"25","author":"D. Fron\u010dek","year":"2002","unstructured":"Fron\u010dek, D.: Cyclic type decompositions of complete bipartite graphs into hypercubes. Australasian Journal of Combinatorics\u00a025, 201\u2013209 (2002)","journal-title":"Australasian Journal of Combinatorics"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/j.disc.2008.02.034","volume":"309","author":"D. Fron\u010dek","year":"2009","unstructured":"Fron\u010dek, D.: Oberwolfach rectangular table negotiation problem. Discr. Math.\u00a0309, 501\u2013504 (2009)","journal-title":"Discr. Math."},{"key":"15_CR6","unstructured":"Fron\u010dek, D., Kov\u00e1\u0159, P., Kubesa, M.: Decomposition of complete graphs into C\n                  \n                    m\n                  [2] (submitted)"},{"key":"15_CR7","first-page":"69","volume":"26","author":"R.W. Frucht","year":"1988","unstructured":"Frucht, R.W., Gallian, J.A.: Labelling Prisms. Ars. Combin.\u00a026, 69\u201382 (1988)","journal-title":"Ars. Combin."},{"key":"15_CR8","series-title":"London Math. Soc. Lecture Note Ser.","first-page":"115","volume-title":"Surveys in combinatorics","author":"R. H\u00e4ggkvist","year":"1989","unstructured":"H\u00e4ggkvist, R.: Decompositions of complete bipartite graphs. In: Surveys in combinatorics, Norwich. London Math. Soc. Lecture Note Ser., vol.\u00a0141, pp. 115\u2013147. Cambridge Univ. Press, Cambridge (1989)"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0012-365X(91)90449-C","volume":"97","author":"W.-L. Piotrowski","year":"1991","unstructured":"Piotrowski, W.-L.: The solution of the bipartite analogue of the Oberwolfach problem. Discr. Math.\u00a097, 339\u2013356 (1991)","journal-title":"Discr. Math."},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0095-8956(81)90093-9","volume":"30","author":"D. Sotteau","year":"1981","unstructured":"Sotteau, D.: Decomposition of K\n                  \n                    m,n\n                   (K\n                  \n                    m,n\n                  *) into cycles (circuits) of length 2k. J. Comb. Theory, Ser. B\u00a030, 75\u201381 (1981)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"15_CR11","unstructured":"Rosa, A.: On certain valuations of the vertices of a graph. In: Theory of Graphs (Internat. Symposium), Rome, July 1966, pp. 349\u2013355. Gordon and Breach, N. Y. and Dunod Paris (1967)"},{"key":"15_CR12","unstructured":"Ringel, G., Llad\u00f3, A.S., Serra, O.: Decomposition of complete bipartite graphs into trees. DMAT Research Report 11\/96, Univ. Politecnica de Catalunya"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10217-2_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:34:27Z","timestamp":1619782467000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10217-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102165","9783642102172"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10217-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}