{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:17Z","timestamp":1725664037537},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578994"},{"type":"electronic","value":"9783540483854"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57899-4_52","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:39:57Z","timestamp":1330245597000},"page":"189-199","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A rainbow about T-colorings for complete graphs"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Jansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"17_CR1","volume-title":"Ph.D. Thesis","author":"I. Bonias","year":"1991","unstructured":"Bonias, I.: T-colorings of complete graphs. Ph.D. Thesis, Northeastern University, Boston, MA (1991)"},{"key":"17_CR2","first-page":"191","volume":"35","author":"M. B. Cozzens","year":"1982","unstructured":"Cozzens, M.B., Roberts, F.S.: T-colorings of graphs and the channel assignment problem. Congress Numerantium 35 (1982) 191\u2013208","journal-title":"Congress Numerantium"},{"key":"17_CR3","unstructured":"Cozzens, M.B., Roberts, F.S.: Greedy algorithms for T-colorings of complete graphs and the meaningfulness of conclusions about them. J. Comb. Inform. Syst. Sci., to appear"},{"key":"17_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"17_CR5","volume-title":"Complete difference sets and T-colorings of complete graphs","author":"A. Gr\u00e4f","year":"1993","unstructured":"Gr\u00e4f, A.: Complete difference sets and T-colorings of complete graphs. Bericht, Universit\u00e4t Mainz 7 (1993)"},{"key":"17_CR6","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"W. K. Hale","year":"1980","unstructured":"Hale, W.K.: Frequency assignment: theory and applications. Proc. IEEE 68 (1980) 1497\u20131514","journal-title":"Proc. IEEE"},{"key":"17_CR7","volume-title":"Ph.D. Thesis","author":"D. D. Liu","year":"1991","unstructured":"Liu, D.D.: Graph homomorphisms and the channel assignment problem. Ph.D. Thesis, University of South Carolina, Columbia, SC (1991)"},{"key":"17_CR8","unstructured":"Raychaudhuri, A.: Further results on T-colorings and frequency assignment problems. SIAM J. Disc. Math. to appear"},{"key":"17_CR9","first-page":"1031","volume-title":"Graph Theory, Combinatorics, and Applications, Vol. 2","author":"F. S. Roberts","year":"1991","unstructured":"Roberts, F.S.: From garbage to rainbows: Generalizations of graph colorings and their applications. Y. Alavi, G. Chartrand, O.R. Oellermann and A.J. Schwenk (eds.): Graph Theory, Combinatorics, and Applications, Vol. 2, Wiley, New York (1991) 1031\u20131052"},{"key":"17_CR10","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0012-365X(91)90258-4","volume":"93","author":"F. S. Roberts","year":"1991","unstructured":"Roberts, F.S.: T-colorings of graphs: recent results and open problems. Disc. Math. 93 (1991) 229\u2013245","journal-title":"Disc. Math."},{"key":"17_CR11","volume-title":"Ph.D. Thesis","author":"B. Tesman","year":"1989","unstructured":"Tesman, B.: T-colorings, list T-colorings, and set T-colorings of graphs. Ph.D. Thesis, Rutgers University, New Brunswick, NJ (1989)"},{"key":"17_CR12","volume-title":"Ph.D. Thesis","author":"D.-I. Wang","year":"1985","unstructured":"Wang, D.-I.: The channel assignment problem and closed neighborhood containment graphs. Ph.D. Thesis, Northeastern University, Boston, MA (1985)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57899-4_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:01:17Z","timestamp":1558252877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57899-4_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578994","9783540483854"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-57899-4_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"26 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}