{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T17:50:11Z","timestamp":1686592211475},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2007,4,12]],"date-time":"2007-04-12T00:00:00Z","timestamp":1176336000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2007,8,16]]},"DOI":"10.1007\/s10878-007-9047-7","type":"journal-article","created":{"date-parts":[[2007,4,18]],"date-time":"2007-04-18T18:12:27Z","timestamp":1176919947000},"page":"349-364","source":"Crossref","is-referenced-by-count":4,"title":["On the equitable k *-laceability of hypercubes"],"prefix":"10.1007","volume":"14","author":[{"given":"Chung-Haw","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao-Ming","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua-Min","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lih-Hsing","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,4,12]]},"reference":[{"key":"9047_CR1","first-page":"193","volume":"24","author":"M Albert","year":"2001","unstructured":"Albert M, Aldred REL, Holton D (2001) On 3*-connected graphs. Australas J Comb 24:193\u2013208","journal-title":"Australas J Comb"},{"key":"9047_CR2","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1109\/2.73","volume":"21","author":"WC Athas","year":"1988","unstructured":"Athas WC, Seitz CL (1988) Multicomputers: Message-passing concurrent computers. IEEE Comput Mag 21:9\u201324","journal-title":"IEEE Comput Mag"},{"key":"9047_CR3","volume-title":"Graph theory with applications","author":"JA Bondy","year":"1980","unstructured":"Bondy JA, Murty USR (1980) Graph theory with applications. North-Holland, New York"},{"key":"9047_CR4","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ipl.2004.06.006","volume":"92","author":"CH Chang","year":"2004","unstructured":"Chang CH, Lin CK, Huang HM, Hsu LH (2004) The super laceability of the hypercubes. Inf Process Lett 92:15\u201321","journal-title":"Inf Process Lett"},{"issue":"4","key":"9047_CR5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0898-1221(88)90215-5","volume":"15","author":"F Harary","year":"1988","unstructured":"Harary F, Lewinter M (1988) The starlike trees which span a hypercube. Comput Math Appl 15(4):299\u2013302","journal-title":"Comput Math Appl"},{"key":"9047_CR6","first-page":"668","volume":"77-A","author":"DF Hsu","year":"1994","unstructured":"Hsu DF (1994) On container width, and length in graphs, groups, and networks. IEICE Trans Fundam 77-A:668\u2013680","journal-title":"IEICE Trans Fundam"},{"key":"9047_CR7","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.disc.2004.08.005","volume":"288","author":"M Kobeissi","year":"2004","unstructured":"Kobeissi M, Mollard M (2004) Disjoint cycles, and spanning graphs of hypercubes. Discret Math 288:73\u201387","journal-title":"Discret Math"},{"key":"9047_CR8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0898-1221(97)00223-X","volume":"34","author":"M Lewinter","year":"1997","unstructured":"Lewinter M, Widulski W (1997) Hyper-Hamilton laceable, and caterpillar product graphs. Comput Math Appl 34:99\u2013104","journal-title":"Comput Math Appl"},{"key":"9047_CR9","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/j.tcs.2005.02.007","volume":"339","author":"CK Lin","year":"2005","unstructured":"Lin CK, Huang HM, Hsu LH (2005) The Super connectivity of the pancake graphs, and the super laceability of the star graphs. Theor Comput Sci 339:257\u2013271","journal-title":"Theor Comput Sci"},{"key":"9047_CR10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K Menger","year":"1927","unstructured":"Menger K (1927) Zur allgemeinen Kurventheorie. Fund Math 10:95\u2013115","journal-title":"Fund Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9047-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9047-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9047-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:11Z","timestamp":1559276291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9047-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4,12]]},"references-count":10,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2007,8,16]]}},"alternative-id":["9047"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9047-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,4,12]]}}}