{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T18:15:25Z","timestamp":1777486525293,"version":"3.51.4"},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"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":6072,"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":[[1996,12]]},"DOI":"10.1016\/0012-365x(95)00225-l","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"197-205","source":"Crossref","is-referenced-by-count":14,"title":["T-graphs and the channel assignment problem"],"prefix":"10.1016","volume":"161","author":[{"given":"Daphne","family":"Der-Fen Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00225-L_BIB1","first-page":"191","article-title":"T-colorings of graphs and the channel assignment problem","volume":"35","author":"Cozzens","year":"1982"},{"key":"10.1016\/0012-365X(95)00225-L_BIB2","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\/0012-365X(95)00225-L_BIB3","first-page":"115","article-title":"The general channel assignment problem","volume":"41","author":"Cozzens","year":"1984"},{"key":"10.1016\/0012-365X(95)00225-L_BIB4","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\/0012-365X(95)00225-L_BIB5","first-page":"1497","article-title":"Frequency assignment: theory and applications","volume":"68","author":"Hale","year":"1980"},{"key":"10.1016\/0012-365X(95)00225-L_BIB6","doi-asserted-by":"crossref","first-page":"203","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\/0012-365X(95)00225-L_BIB7","article-title":"Graph homomorphisms and the channel assignment problem","author":"Liu","year":"1991"},{"key":"10.1016\/0012-365X(95)00225-L_BIB8","first-page":"27","article-title":"On a conjecture of T-colorings","volume":"103","author":"Liu","year":"1994"},{"key":"10.1016\/0012-365X(95)00225-L_BIB9","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1137\/0606050","article-title":"An asymptotic approach to the channel assignment problem","volume":"6","author":"Rabinowitz","year":"1995","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0012-365X(95)00225-L_BIB10","article-title":"Intersection assignment, T-colorings, and powers of graphs","author":"Raychaudhuri","year":"1985"},{"key":"10.1016\/0012-365X(95)00225-L_BIB11","doi-asserted-by":"crossref","unstructured":"A. Raychaudhuri, Further results on T-coloring and frequency assignment problems, SIAM J. Discrete Math., to appear.","DOI":"10.1137\/S0895480189171746"},{"key":"10.1016\/0012-365X(95)00225-L_BIB12","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\/0012-365X(95)00225-L_BIB13","article-title":"T-colorings, list T-colorings, and set T-colorings of graphs","author":"Tesman","year":"1989"},{"key":"10.1016\/0012-365X(95)00225-L_BIB14","article-title":"The Channel assignment problem and closed neighborhood containment graphs","author":"Wang","year":"1985"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500225L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500225L?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:26:07Z","timestamp":1556130367000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9500225L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["0012365X9500225L"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00225-l","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}