{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:52Z","timestamp":1759637632742},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"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":3516,"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,12]]},"DOI":"10.1016\/s0012-365x(03)00236-x","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T10:49:36Z","timestamp":1063363776000},"page":"183-192","source":"Crossref","is-referenced-by-count":16,"title":["Channel assignment on graphs of bounded treewidth"],"prefix":"10.1016","volume":"273","author":[{"given":"Colin","family":"McDiarmid","sequence":"first","affiliation":[]},{"given":"Bruce","family":"Reed","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00236-X_BIB1","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","article-title":"Easy problems for tree decomposable graphs","volume":"12","author":"Arnborg","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/S0012-365X(03)00236-X_BIB2","series-title":"Complexity and Approximation","author":"Ausiello","year":"1999"},{"key":"10.1016\/S0012-365X(03)00236-X_BIB3","unstructured":"F. Barasi, J. van den Heuvel, Graph labelling, orientations, and greedy algorithms, 2001, in preparation."},{"key":"10.1016\/S0012-365X(03)00236-X_BIB4","doi-asserted-by":"crossref","unstructured":"H. Bodlaender, A linear time algorithm for finding tree decompositions of small treewidth, Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, San Diego, USA, 1993, pp. 226\u2013234.","DOI":"10.1145\/167088.167161"},{"key":"10.1016\/S0012-365X(03)00236-X_BIB5","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0012-365X(03)00236-X_BIB6","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(03)00236-X_BIB7","unstructured":"S. Hurley, R. Leese (Eds.), Methods and Algorithms for Radio Channel Assignment, Oxford University Press, Oxford, 2002."},{"key":"10.1016\/S0012-365X(03)00236-X_BIB8","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1002\/(SICI)1097-0118(199707)25:3<207::AID-JGT4>3.0.CO;2-P","article-title":"Coloring precolored perfect graphs","volume":"25","author":"Kratochvil","year":"1997","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00236-X_BIB9","series-title":"Recent Advances in Algorithmic Combinatorics","article-title":"Discrete mathematics and channel assignment","volume":"Vol. 11","author":"McDiarmid","year":"2003"},{"key":"10.1016\/S0012-365X(03)00236-X_BIB10","doi-asserted-by":"crossref","unstructured":"B. Reed, Tree width and tangles, a new measure of connectivity and some consequences, in: R. Bailey (Ed.), Surveys in Combinatorics, 1997, London Mathematical Society Lecture Note Series 241, Cambridge University Press, Cambridge, 1997.","DOI":"10.1017\/CBO9780511662119.006"},{"key":"10.1016\/S0012-365X(03)00236-X_BIB11","series-title":"Introduction to Graph Theory","author":"West","year":"1996"},{"key":"10.1016\/S0012-365X(03)00236-X_BIB12","unstructured":"S. Whitesides, Algorithmic issues in the geometry of planar linkage movement, Austral. Comput. J. (special issue on algorithms), (1992) 42\u201350."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X0300236X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X0300236X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T08:21:22Z","timestamp":1550996482000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X0300236X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0012365X0300236X"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00236-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}