{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:32:49Z","timestamp":1771036369876,"version":"3.50.1"},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"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":5951,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1997,4]]},"DOI":"10.1016\/s0012-365x(96)00257-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:36:38Z","timestamp":1027618598000},"page":"571-582","source":"Crossref","is-referenced-by-count":45,"special_numbering":"C","title":["Bounds for the frequency assignment problem"],"prefix":"10.1016","volume":"167-168","author":[{"given":"D.H.","family":"Smith","sequence":"first","affiliation":[]},{"given":"S.","family":"Hurley","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00257-9_BIB1","series-title":"Graph Colourings","first-page":"87","article-title":"Some heuristics for graph colouring","author":"Biggs","year":"1990"},{"key":"10.1016\/S0012-365X(96)00257-9_BIB2","series-title":"Conf. on Applied Decision Technologies: Modern Heuristic Methods","first-page":"233","article-title":"Tabu search for the radio links frequency assignment problem","author":"Bouju","year":"1995"},{"key":"10.1016\/S0012-365X(96)00257-9_BIB3","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF02125459","article-title":"A tabu search algorithm for frequency assignment","volume":"63","author":"Castelino","year":"1996","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0012-365X(96)00257-9_BIB4","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02023000","article-title":"On the use of some known methods for T-colourings of graphs","volume":"41","author":"Costa","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0012-365X(96)00257-9_BIB5","first-page":"191","article-title":"T-Colorings of graphs and the channel assignment problem","volume":"35","author":"Cozzens","year":"1982"},{"key":"10.1016\/S0012-365X(96)00257-9_BIB6","first-page":"115","article-title":"The general channel assignment problem","volume":"41","author":"Cozzens","year":"1984"},{"key":"10.1016\/S0012-365X(96)00257-9_BIB7","first-page":"26\/1","article-title":"Frequency assignment using a parallel genetic algorithm","volume":"vol. 2","author":"Crompton","year":"1993"},{"key":"10.1016\/S0012-365X(96)00257-9_BIB8","series-title":"Proc. IMACS\/IEEE Conf. on Signal Processing, Robotics and Neural Networks","first-page":"81","article-title":"A parallel genetic algorithm for frequency assignment problems","author":"Crompton","year":"1994"},{"key":"10.1016\/S0012-365X(96)00257-9_BIB9","first-page":"352","article-title":"Solution to advanced problem number 4526","volume":"61","author":"Descartes","year":"1954","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0012-365X(96)00257-9_BIB10","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1109\/T-VT.1982.23925","article-title":"Homogeneous distribution of frequencies in a regular hexagonal cell system","volume":"31","author":"Gamst","year":"1982","journal-title":"IEEE Trans. Vehicular Techn."},{"key":"10.1016\/S0012-365X(96)00257-9_BIB11","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/T-VT.1986.24063","article-title":"Some lower bounds for a class of frequency assignment problems","volume":"35","author":"Gamst","year":"1986","journal-title":"IEEE Trans. Vehicular Techn."},{"key":"10.1016\/S0012-365X(96)00257-9_BIB12","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF02023002","article-title":"Solving the maximum clique problem using a tabu search approach","volume":"41","author":"Gendreau","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0012-365X(96)00257-9_BIB13","first-page":"1497","article-title":"Frequency assignment: theory and applications","volume":"68","author":"Hale","year":"1980"},{"key":"10.1016\/S0012-365X(96)00257-9_BIB14","series-title":"Proc. IEEE Internat. Symp. on Electromagnetic Compatibility Record","first-page":"47","article-title":"New spectrum management tools","author":"Hale","year":"1981"},{"key":"10.1016\/S0012-365X(96)00257-9_BIB15","first-page":"48","article-title":"On the shortest spanning subtree of a graph and the travelling salesman problem","volume":"7","author":"Kruskal","year":"1956"},{"key":"10.1016\/S0012-365X(96)00257-9_BIB16","article-title":"Graph theory and radio frequency assignment","author":"Lanfear","year":"1989"},{"key":"10.1016\/S0012-365X(96)00257-9_BIB17","unstructured":"R. Leese, A unified approach to the assignment of radio channels on a regular hexagonal grid, to appear."},{"key":"10.1016\/S0012-365X(96)00257-9_BIB18","series-title":"IMA Conf. on Applications of Combinatorial Mathematics","article-title":"A unified approach to problems in radio channel assignment","author":"Leese","year":"1994"},{"key":"10.1016\/S0012-365X(96)00257-9_BIB19","doi-asserted-by":"crossref","first-page":"161","DOI":"10.4064\/cm-3-2-161-162","article-title":"Sur le coloriage des graphs","volume":"3","author":"Mycielski","year":"1955","journal-title":"Colloq. Math."},{"key":"10.1016\/S0012-365X(96)00257-9_BIB20","article-title":"The frequency assignment problem as a weighted graph colouring problem","author":"Peeters","year":"1991"},{"key":"10.1016\/S0012-365X(96)00257-9_BIB21","article-title":"Intersection assignments, T-colourings and powers of graphs","author":"Raychaudhuri","year":"1985"},{"key":"10.1016\/S0012-365X(96)00257-9_BIB22","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0012-365X(91)90258-4","article-title":"T-colorings of graphs: recent results and open problems","volume":"93","author":"Roberts","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00257-9_BIB23","first-page":"205","article-title":"Graph colouring and frequency assignment","volume":"25C","author":"Smith","year":"1988","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(96)00257-9_BIB24","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1109\/TEMC.1977.303601","article-title":"A breakthrough in spectrum conserving frequency assignment technology","author":"Zoellner","year":"1977","journal-title":"IEEE Trans. on Electromagnetic Compatibility, EMC-19"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96002579?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96002579?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:27:33Z","timestamp":1556130453000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96002579"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":24,"alternative-id":["S0012365X96002579"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00257-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}