{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T17:47:49Z","timestamp":1775152069939,"version":"3.50.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4764,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s0166-218x(99)00249-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:38:45Z","timestamp":1027651125000},"page":"307-311","source":"Crossref","is-referenced-by-count":29,"title":["A coloring problem on the n-cube"],"prefix":"10.1016","volume":"103","author":[{"given":"Dongsoo S.","family":"Kim","sequence":"first","affiliation":[]},{"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00249-8_BIB1","doi-asserted-by":"crossref","unstructured":"D.-Z. Du, F.K. Hwang, Combinatorial Group Testing and Its Applications, World Scientific, Singapore, 1993, pp. 62\u201387.","DOI":"10.1142\/9789812798183_0004"},{"key":"10.1016\/S0166-218X(99)00249-8_BIB2","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF01096415","article-title":"Test case generators and computational results for the maximum clique problem","volume":"3","author":"Hasselberg","year":"1993","journal-title":"J. Global Optim."},{"key":"10.1016\/S0166-218X(99)00249-8_BIB3","doi-asserted-by":"crossref","unstructured":"A. Pavan, P.-J. Wan, S.-R. Tong, D.H. Du, A new multihop lightwave network based on the generalized de-Bruijn graph, Proceedings on IEEE INFOCOM, 1996, pp. 498\u2013507.","DOI":"10.1109\/LCN.1996.558180"},{"key":"10.1016\/S0166-218X(99)00249-8_BIB4","unstructured":"S. Roman, Coding and Information Theory, Springer, New York, 1992, pp. 253\u2013263."},{"key":"10.1016\/S0166-218X(99)00249-8_BIB5","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1023\/A:1009759916586","article-title":"Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network","volume":"1","author":"Wan","year":"1997","journal-title":"J Combin. Optim."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99002498?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99002498?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T10:59:52Z","timestamp":1555239592000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99002498"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0166218X99002498"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00249-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}