{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T20:51:31Z","timestamp":1660251091399},"reference-count":18,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3674,"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":[[2003,8]]},"DOI":"10.1016\/s0166-218x(02)00576-0","type":"journal-article","created":{"date-parts":[[2003,8,12]],"date-time":"2003-08-12T11:29:34Z","timestamp":1060687774000},"page":"361-369","source":"Crossref","is-referenced-by-count":4,"title":["The complexity of the T-coloring problem for graphs with small degree"],"prefix":"10.1016","volume":"129","author":[{"given":"Krzysztof","family":"Giaro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Janczewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Ma\u0142afiejski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00576-0_BIB1","doi-asserted-by":"crossref","unstructured":"M.O. Albertson, Generalized Colorings, Academic Press, New York, 1987, pp. 35\u201349.","DOI":"10.1016\/B978-0-12-386870-1.50008-3"},{"key":"10.1016\/S0166-218X(02)00576-0_BIB2","doi-asserted-by":"crossref","unstructured":"M. Bellare, O. Goldreich, M. Sudan, Free bits, PCP and non-approximability towards tight results, Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, Los Alamos, 1995, pp. 422\u2013431.","DOI":"10.1109\/SFCS.1995.492573"},{"key":"10.1016\/S0166-218X(02)00576-0_BIB3","first-page":"191","article-title":"T-colorings of graphs and the channel assignment problem","volume":"35","author":"Cozzens","year":"1982","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(02)00576-0_BIB4","first-page":"286","article-title":"Greedy algorithms for T-colorings of complete graphs and the meaningfulness of conclusions about them","volume":"16","author":"Cozzens","year":"1991","journal-title":"J. Combin. Inform. System Sci."},{"key":"10.1016\/S0166-218X(02)00576-0_BIB5","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1002\/jgt.3190120108","article-title":"Homomorphisms of graphs into odd cycles","volume":"12","author":"Gerards","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(02)00576-0_BIB6","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0012-365X(98)00199-X","article-title":"Distance graphs and the T-coloring problem","volume":"196","author":"Gr\u00e4f","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00576-0_BIB7","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0097-3165(94)90096-5","article-title":"The channel assignment problem for mutually adjacent sites","volume":"68","author":"Griggs","year":"1994","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0166-218X(02)00576-0_BIB8","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":"Proceedings IEEE"},{"key":"10.1016\/S0166-218X(02)00576-0_BIB9","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","article-title":"On the complexity of H-coloring","volume":"48","author":"Hell","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(02)00576-0_BIB10","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","article-title":"The NP-completeness of edge-coloring","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(02)00576-0_BIB11","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0012-365X(00)00378-2","article-title":"A note on divisibility and T-span of graphs","volume":"234","author":"Janczewski","year":"2001","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00576-0_BIB12","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0012-365X(94)00344-I","article-title":"A rainbow about T-colorings for complete graphs","volume":"154","author":"Jansen","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00576-0_BIB13","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0012-365X(92)90603-D","article-title":"T-colorings of graphs","volume":"101","author":"Liu","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00576-0_BIB14","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0012-365X(95)00225-L","article-title":"T-graphs and the channel assignment problem","volume":"161","author":"Liu","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00576-0_BIB15","first-page":"605","article-title":"Further results on T-colorings and frequency assignment problem","volume":"7","author":"Raychaudhuri","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00576-0_BIB16","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0012-365X(91)90258-4","article-title":"T-coloring of graphs","volume":"93","author":"Roberts","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00576-0_BIB17","unstructured":"B. Tesman, T-colorings, list T-colorings and set T-colorings of graphs, Ph.D. Thesis, Department of Math. Rutgers University, New Brunswick, NJ, 1989."},{"key":"10.1016\/S0166-218X(02)00576-0_BIB18","unstructured":"B. Tesman, Applications of forbidden difference graphs to T-colorings, Congressus Numerautium 74 (1990), 15\u201324."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02005760?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02005760?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T16:22:25Z","timestamp":1552580545000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02005760"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":18,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0166218X02005760"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00576-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}