{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T20:12:48Z","timestamp":1774383168327,"version":"3.50.1"},"reference-count":54,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1991,11,1]],"date-time":"1991-11-01T00:00:00Z","timestamp":688953600000},"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":7929,"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":[[1991,11]]},"DOI":"10.1016\/0012-365x(91)90258-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"229-245","source":"Crossref","is-referenced-by-count":162,"title":["T-colorings of graphs: recent results and open problems"],"prefix":"10.1016","volume":"93","author":[{"given":"Fred S.","family":"Roberts","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(91)90258-4_BIB1","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0377-2217(82)90033-9","article-title":"Optimal assignment of broadcasting frequencies","volume":"9","author":"Baybars","year":"1982","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0012-365X(91)90258-4_BIB2","first-page":"7","article-title":"Spectrum-efficient frequency assignment in mixed service bands","author":"Berry","year":"1982","journal-title":"Proceedings of the IEEE International Symposium on Electromagnetic Compatibility Record"},{"key":"10.1016\/0012-365X(91)90258-4_BIB3","first-page":"75","article-title":"The spectrum cost of frequency-distance separation rules","author":"Berry","year":"1983","journal-title":"Proceedings of the IEEE International Symposium on Electromagnetic Compatibility Record"},{"key":"10.1016\/0012-365X(91)90258-4_BIB4","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1109\/PROC.1977.10517","article-title":"Applications of numbered, undirected graphs","volume":"65","author":"Bloom","year":"1977","journal-title":"Proc. IEEE"},{"key":"10.1016\/0012-365X(91)90258-4_BIB5","series-title":"Theory and Applications of Graphs","first-page":"53","article-title":"Numbered complete graphs, unusual rulers, and assorted applications","author":"Bloom","year":"1978"},{"key":"10.1016\/0012-365X(91)90258-4_BIB6","series-title":"Graphs and Combinatorics","first-page":"201","article-title":"On covering the points of a graph with point disjoint paths","author":"Boesch","year":"1974"},{"key":"10.1016\/0012-365X(91)90258-4_BIB7","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF02582936","article-title":"List colourings of graphs","volume":"1","author":"Bollob\u00e1s","year":"1985","journal-title":"Graphs Combin."},{"key":"10.1016\/0012-365X(91)90258-4_BIB8","series-title":"Ph.D. Thesis","article-title":"T-Colorings of complete graphs","author":"Bonias","year":"1991"},{"key":"10.1016\/0012-365X(91)90258-4_BIB9","series-title":"The Theory and Applications of Graphs","first-page":"243","article-title":"On the bandwidths of a graph and its complement","author":"Chinn","year":"1981"},{"key":"10.1016\/0012-365X(91)90258-4_BIB10","series-title":"Topics on Perfect Graphs","first-page":"63","article-title":"Perfectly Ordered Graphs","author":"Chv\u00e1tal","year":"1984"},{"key":"10.1016\/0012-365X(91)90258-4_BIB11","series-title":"Ph.D. Dissertation","article-title":"On the bandwidth problem for graphs","author":"Chvatalova","year":"1980"},{"key":"10.1016\/0012-365X(91)90258-4_BIB12","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0603058","article-title":"Double semiorders and double indifference graphs","volume":"3","author":"Cozzens","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0012-365X(91)90258-4_BIB13","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\/0012-365X(91)90258-4_BIB14","article-title":"Greedy algorithms for T -colorings of complete graphs and the meaningfulness of conclusions about them","author":"Cozzens","year":"1992","journal-title":"J. Comb. Inform. Syst. Sci."},{"key":"10.1016\/0012-365X(91)90258-4_BIB15","first-page":"115","article-title":"The general channel assignment problem","volume":"41","author":"Cozzens","year":"1984","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(91)90258-4_BIB16","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0608005","article-title":"Threshold representations of multiple semiorders","volume":"8","author":"Doignon","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0012-365X(91)90258-4_BIB17","first-page":"125","article-title":"Choosability in graphs","volume":"26","author":"Erd\u00f6s","year":"1979","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(91)90258-4_BIB18","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1137\/0402044","article-title":"Pair labellings with given distance","volume":"2","author":"F\u00fcredi","year":"1989","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0012-365X(91)90258-4_BIB19","author":"Gilbert","year":"1972"},{"key":"10.1016\/0012-365X(91)90258-4_BIB20","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0012-365X(91)90258-4_BIB21","series-title":"Graphs and Combinatorics","first-page":"262","article-title":"On the Hamiltonian completion problem","author":"Goodman","year":"1974"},{"key":"10.1016\/0012-365X(91)90258-4_BIB22","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","article-title":"The ellipsoid method and its consequences in combinatorial optimization","volume":"1","author":"Gr\u00f6tschel","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(91)90258-4_BIB23","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","article-title":"Frequency assignment: theory and applications","volume":"68","author":"Hale","year":"1980","journal-title":"Proc. IEEE"},{"key":"10.1016\/0012-365X(91)90258-4_BIB24","series-title":"National Telecommunications and Information Administration Report","article-title":"Frequency assignment methodology: an annotated bibliography","author":"Hale","year":"1980"},{"key":"10.1016\/0012-365X(91)90258-4_BIB25","series-title":"Spectrum Utilization Division, S.U.D. Working Paper 81-30","article-title":"Spectrum efficiency as a function of frequency-distance rules: an application to UHF-TV","author":"Hale","year":"1981"},{"key":"10.1016\/0012-365X(91)90258-4_BIB26","first-page":"47","article-title":"New spectrum management tools","author":"Hale","year":"1981","journal-title":"Proceedings of the IEEE International Symposium on Electromagnetic Compatibility Record"},{"key":"10.1016\/0012-365X(91)90258-4_BIB27","first-page":"361","article-title":"The combinatorial distance geometry approach to the calculation of molecular conformation","volume":"35","author":"Havel","year":"1982","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(91)90258-4_BIB28","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0022-5193(83)90112-1","article-title":"The combinatorial distance geometry approach to the calculation of molecular conformation I: A new approach to an old problem","volume":"104","author":"Havel","year":"1983","journal-title":"J. Theor. Biol."},{"key":"10.1016\/0012-365X(91)90258-4_BIB29","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0022-5193(83)90113-3","article-title":"The combinatorial distance geometry approach to the calculation of molecular conformation II: Sample problems and computational statistics","volume":"104","author":"Havel","year":"1983","journal-title":"J. Theor. Biol."},{"key":"10.1016\/0012-365X(91)90258-4_BIB30","series-title":"Allied Radio Frequency Agency","article-title":"A frequency assignment scenario","author":"Lanfear","year":"1988"},{"key":"10.1016\/0012-365X(91)90258-4_BIB31","series-title":"RUTCOR","article-title":"Radio frequency assignment and graph coloring","author":"Lanfear","year":"1988"},{"key":"10.1016\/0012-365X(91)90258-4_BIB32","series-title":"Ph.D. Thesis","article-title":"Graph homomorphisms and the channel assignment problem","author":"Liu","year":"1991"},{"key":"10.1016\/0012-365X(91)90258-4_BIB33","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0166-218X(84)90113-6","article-title":"Space graphs and sphericity","volume":"7","author":"Maehara","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(91)90258-4_BIB34","article-title":"Spectrum management technique","author":"Metzger","year":"1970","journal-title":"38th National ORSA Meeting"},{"key":"10.1016\/0012-365X(91)90258-4_BIB35","series-title":"Rep. 89594-OR","article-title":"On the complexity of recognizing perfectly orderable graphs","author":"Middendorf","year":"1989"},{"key":"10.1016\/0012-365X(91)90258-4_BIB36","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1109\/TCE.1978.266971","article-title":"UHF taboos\u2014history and development","volume":"CE-24","author":"Middlekamp","year":"1978","journal-title":"IEEE Trans. Consumer Electron"},{"key":"10.1016\/0012-365X(91)90258-4_BIB37","series-title":"The Theory and Applications of Graphs","first-page":"479","article-title":"On the fleet maintenance, mobile radio frequency, task assignment, and traffic phasing problems","author":"Opsut","year":"1981"},{"key":"10.1016\/0012-365X(91)90258-4_BIB38","series-title":"Tech. Rep. DSA No. 261","article-title":"Optimal allocation of TV channels\u2014a feasibility study","author":"Pugh","year":"1981"},{"key":"10.1016\/0012-365X(91)90258-4_BIB39","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":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0012-365X(91)90258-4_BIB40","series-title":"Ph.D. Thesis","article-title":"Intersection assignments, T -coloring, and powers of graphs","author":"Raychaudhuri","year":"1985"},{"key":"10.1016\/0012-365X(91)90258-4_BIB41","doi-asserted-by":"crossref","unstructured":"A. Raychaudhuri, Further results on T-colorings and frequency assignment problems, SIAM J. Discrete Math., to appear.","DOI":"10.1137\/S0895480189171746"},{"key":"10.1016\/0012-365X(91)90258-4_BIB42","series-title":"CBMS-NSF Monograph No. 29","article-title":"Graph theory and its applications to problems of society","author":"Roberts","year":"1978"},{"key":"10.1016\/0012-365X(91)90258-4_BIB43","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1111\/j.1749-6632.1979.tb32824.x","article-title":"On the mobile radio frequency assignment problem and the traffic light phasing problem","volume":"319","author":"Roberts","year":"1979","journal-title":"Ann. New York Acad. Sci."},{"key":"10.1016\/0012-365X(91)90258-4_BIB44","first-page":"1031","article-title":"From garbage to rainbows: generalizations of graph colorings and their applications","volume":"Vol. 2","author":"Roberts","year":"1991"},{"key":"10.1016\/0012-365X(91)90258-4_BIB45","doi-asserted-by":"crossref","unstructured":"F.S. Roberts, No-hole 2-distant colorings, Computers and Math. with Applications, to appear.","DOI":"10.1016\/0895-7177(93)90265-Z"},{"key":"10.1016\/0012-365X(91)90258-4_BIB46","doi-asserted-by":"crossref","unstructured":"D. Sakai and C. Wang, No-hole r + 1 distant colorings, Discrete Appl. Math., to appear.","DOI":"10.1016\/0012-365X(93)90125-D"},{"key":"10.1016\/0012-365X(91)90258-4_BIB47","first-page":"205","article-title":"Graph colouring and frequency assignment","volume":"25C","author":"Smith","year":"1988","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(91)90258-4_BIB48","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0095-8956(76)90010-1","article-title":"n-tuple colorings and associated graphs","volume":"20","author":"Stahl","year":"1976","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(91)90258-4_BIB49","series-title":"Ph.D. Thesis","article-title":"T-colorings, list T-colorings, and set T-colorings of graphs","author":"Tesman","year":"1989"},{"key":"10.1016\/0012-365X(91)90258-4_BIB50","first-page":"15","article-title":"Applications of forbidden difference graphs to T -coloring","volume":"74","author":"Tesman","year":"1990","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(91)90258-4_BIB51","first-page":"229","article-title":"Set T-colorings","volume":"77","author":"Tesman","year":"1990","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(91)90258-4_BIB52","series-title":"Ph.D. Thesis","article-title":"The channel assignment problem and closed neighborhood containment graphs","author":"Wang","year":"1985"},{"key":"10.1016\/0012-365X(91)90258-4_BIB53","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1109\/TEMC.1973.303294","article-title":"Frequency assignment games and strategies","volume":"EMC-15","author":"Zoellner","year":"1973","journal-title":"IEEE Trans. on Electromag. Compatibility"},{"key":"10.1016\/0012-365X(91)90258-4_BIB54","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1109\/TEMC.1977.303601","article-title":"A breakthrough in spectrum conserving frequency assignment technology","volume":"EMC-19","author":"Zoellner","year":"1977","journal-title":"IEEE Trans. on Electromag. Compatibility"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X91902584?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X91902584?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:22:16Z","timestamp":1555136536000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X91902584"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,11]]},"references-count":54,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1991,11]]}},"alternative-id":["0012365X91902584"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(91)90258-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,11]]}}}