{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T01:57:10Z","timestamp":1648691830046},"reference-count":13,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2015,9]]},"abstract":"<jats:p> In this paper, we consider the problem of decomposing the edge set of the hypercube Q<jats:sub>n<\/jats:sub> into two spanning, regular, connected, bipancyclic subgraphs. We prove that if n = n<jats:sub>1<\/jats:sub> + n<jats:sub>2<\/jats:sub> with n<jats:sub>1<\/jats:sub> \u2265 2 and n<jats:sub>2<\/jats:sub> \u2265 2, then the edge set of Q<jats:sub>n<\/jats:sub> can be decomposed into two spanning, bipancyclic subgraphs H<jats:sub>1<\/jats:sub> and H<jats:sub>2<\/jats:sub> such that H<jats:sub>i<\/jats:sub> is n<jats:sub>i<\/jats:sub>-regular and n<jats:sub>i<\/jats:sub>-connected for i = 1, 2. <\/jats:p>","DOI":"10.1142\/s1793830915500330","type":"journal-article","created":{"date-parts":[[2015,6,22]],"date-time":"2015-06-22T03:29:31Z","timestamp":1434943771000},"page":"1550033","source":"Crossref","is-referenced-by-count":7,"title":["Decomposition of hypercubes into regular connected bipancyclic subgraphs"],"prefix":"10.1142","volume":"07","author":[{"given":"Y. M.","family":"Borse","sequence":"first","affiliation":[{"name":"Department of Mathematics, Savitribai Phule Pune University, Pune 411007, India"}]},{"given":"S. A.","family":"Kandekar","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Savitribai Phule Pune University, Pune 411007, India"}]}],"member":"219","published-online":{"date-parts":[[2015,9,29]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00061"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2011.093011.100321"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2014.07.019"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.08.043"},{"key":"rf6","volume-title":"Introduction to Parallel Algorithms and Archtectures: Arrays, Trees, Hypercubes","author":"Leighton F. T.","year":"1992"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(03)00258-8"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511662133.005"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2011.08.071"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-013-1402-0"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01789464"},{"key":"rf13","first-page":"3","volume":"46","author":"Ramras M.","year":"1997","journal-title":"Ars Combin."},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2007.06.010"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2012.01.033"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830915500330","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T14:01:59Z","timestamp":1565186519000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830915500330"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9]]},"references-count":13,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2015,9,29]]},"published-print":{"date-parts":[[2015,9]]}},"alternative-id":["10.1142\/S1793830915500330"],"URL":"https:\/\/doi.org\/10.1142\/s1793830915500330","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9]]}}}