{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:03Z","timestamp":1761611103101},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"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":3730,"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":[[2003,5]]},"DOI":"10.1016\/s0012-365x(02)00821-x","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T16:52:26Z","timestamp":1053363146000},"page":"387-397","source":"Crossref","is-referenced-by-count":27,"title":["On the span in channel assignment problems: bounds, computing and counting"],"prefix":"10.1016","volume":"266","author":[{"given":"Colin","family":"McDiarmid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(02)00821-X_BIB1","unstructured":"F. Barasi, J. van den Heuvel, Graph labelling, orientations, and greedy algorithms, 2001, in preparation."},{"key":"10.1016\/S0012-365X(02)00821-X_BIB2","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1137\/S0097539796302531","article-title":"Free bits, PCPs and non-approximability\u2014towards tight results","volume":"27","author":"Bellare","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0012-365X(02)00821-X_BIB3","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","article-title":"Frequency assignment","volume":"68","author":"Hale","year":"1980","journal-title":"Proc. IEEE"},{"key":"10.1016\/S0012-365X(02)00821-X_BIB4","doi-asserted-by":"crossref","unstructured":"R.A. Leese, S. Hurley (Eds.), Methods and Algorithms for Radio Channel Assignment, Oxford University Press, Oxford, 2003, pp. 63\u201387.","DOI":"10.1093\/oso\/9780198503149.001.0001"},{"key":"10.1016\/S0012-365X(02)00821-X_BIB5","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/0020-0190(76)90065-X","article-title":"A note on the complexity of the chromatic number problem","volume":"5","author":"Lawler","year":"1976","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0012-365X(02)00821-X_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0208001","article-title":"Determining the chromatic number of a graph","volume":"8","author":"McDiarmid","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0012-365X(02)00821-X_BIB7","unstructured":"C. McDiarmid, Counting and constraint matrices, manuscript, 1998."},{"key":"10.1016\/S0012-365X(02)00821-X_BIB8","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/S0012-365X(00)00016-9","article-title":"Frequency-distance constraints with large distances","volume":"223","author":"McDiarmid","year":"2000","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(02)00821-X_BIB9","doi-asserted-by":"crossref","unstructured":"C. McDiarmid, Channel assignment and discrete mathematics, in: C. Linhares-Salas, B. Reed (Eds.), Recent Advances in Algorithmic Combinatorics, Springer, Berlin, 2003.","DOI":"10.1007\/0-387-22444-0_2"},{"key":"10.1016\/S0012-365X(02)00821-X_BIB10","doi-asserted-by":"crossref","unstructured":"C. McDiarmid, B.A. Reed, Channel assignment on graphs of bounded treewidth, Comb01, Euroconference on Combinatorics, Graph Theory and Applications, CRM, Bellaterra, Barcelona, Spain, Electronic Notes in Discrete Mathematics, Vol. 10, September 2001.","DOI":"10.1016\/S1571-0653(04)00393-2"},{"key":"10.1016\/S0012-365X(02)00821-X_BIB11","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/S0012-365X(96)00257-9","article-title":"Bounds for the frequency assignment problem","volume":"167\/168","author":"Smith","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(02)00821-X_BIB12","unstructured":"D.B. West, Introduction to Graph Theory, 2nd Edition, Prentice-Hall, Englewood Cliffs, NJ, 2001."},{"key":"10.1016\/S0012-365X(02)00821-X_BIB13","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1006\/aama.1999.0660","article-title":"Arrangements, channel assignments and associated polynomials","volume":"23","author":"Welsh","year":"1999","journal-title":"Adv. Appl. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X0200821X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X0200821X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T01:05:53Z","timestamp":1704762353000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X0200821X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0012365X0200821X"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(02)00821-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}