{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,20]],"date-time":"2023-05-20T18:10:29Z","timestamp":1684606229690},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2008,10,1]],"date-time":"2008-10-01T00:00:00Z","timestamp":1222819200000},"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":[[2008,10]]},"DOI":"10.1007\/s00373-008-0799-3","type":"journal-article","created":{"date-parts":[[2008,10,25]],"date-time":"2008-10-25T05:24:20Z","timestamp":1224912260000},"page":"429-442","source":"Crossref","is-referenced-by-count":2,"title":["Silver Cubes"],"prefix":"10.1007","volume":"24","author":[{"given":"Mohammad","family":"Ghebleh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis A.","family":"Goddyn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ebadollah S.","family":"Mahmoodian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maryam","family":"Verdian-Rizi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,10,26]]},"reference":[{"key":"799_CR1","unstructured":"Brouwer, A.E., H\u00e4m\u00e4l\u00e4inen, H.O., \u00d6sterg\u00e5rd, P.R.J., Sloane, N.J.A.: Bounds on mixed binary\/ternary codes. IEEE Trans. Inform. Theory 44, 140\u2013161 (1998)"},{"key":"799_CR2","unstructured":"Culberson, J.: http:\/\/web.cs.ualberta.ca\/~joe\/Coloring\/"},{"key":"799_CR3","unstructured":"Donovan, D., Mahmoodian, E.S., Ramsay, C., Street, A.P.: Defining sets in combinatorics: a survey. In: Surveys in combinatorics, 2003 (Bangor), (Cambridge Univ. Press, Cambridge, 2003) London Math. Soc. Lecture Note Ser. 307, 115\u2013174"},{"key":"799_CR4","doi-asserted-by":"crossref","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of domination in graphs. Marcel Dekker, New York (1998)","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F"},{"key":"799_CR5","unstructured":"Kim, D.S., Du, D.-Z., Pardalos, P.: A coloring problem on the n-cube. Discrete Appl. Math. 103, 307\u2013311 (2000)"},{"key":"799_CR6","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes. North-Holland Publishing Co., Amsterdam, (1977)"},{"key":"799_CR7","unstructured":"Mahdian, M., Mahmoodian, E.S.: The roots of an IMO97 problem. Bull. Inst. Combin. Appl. 28, 48\u201354 (2000)"},{"key":"799_CR8","doi-asserted-by":"crossref","unstructured":"Mahmoodian, E.S., Naserasr, R., Zaker, M.: Defining sets in vertex colorings of graphs and Latin rectangles, 15th British Combinatorial Conference (Stirling, 1995). Discrete Math. 167\/168, 451\u2013460 (1997)","DOI":"10.1016\/S0012-365X(96)00247-6"},{"key":"799_CR9","unstructured":"\u00d6sterg\u00e5rd, P.R.J., Baicheva, T., Kolev, E.: Optimal binary one-error-correcting codes of length 10 have 72 codewords. IEEE Trans. Inform. Theory 45, 1229\u20131231 (1999)"},{"key":"799_CR10","unstructured":"Ventullo, K., Khodkar, A.: A three dimensional silver cube of order seven. Bull. Inst. Combin. Appl. (to appear)"},{"key":"799_CR11","unstructured":"Wan, P.J.: Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network. J. Comb. Optim. 1, 179\u2013186 (1997)"},{"key":"799_CR12","unstructured":"Zhou, S.: Labelling Cayley graphs on abelian groups. SIAM J. Discrete Math. 19, 985\u20131003 (2005)"},{"key":"799_CR13","unstructured":"Zhou, S.: A channel assignment problem for optical networks modelled by Cayley graphs. Theoret. Comput. Sci. 310, 501\u2013511 (2004)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0799-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-008-0799-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0799-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,20]],"date-time":"2023-05-20T17:54:29Z","timestamp":1684605269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-008-0799-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["799"],"URL":"https:\/\/doi.org\/10.1007\/s00373-008-0799-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10]]}}}