{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:08:43Z","timestamp":1725566923910},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642340611"},{"type":"electronic","value":"9783642340628"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34062-8_36","type":"book-chapter","created":{"date-parts":[[2012,9,7]],"date-time":"2012-09-07T08:52:58Z","timestamp":1347007978000},"page":"277-283","source":"Crossref","is-referenced-by-count":0,"title":["Span of T-Colorings Multigraphs"],"prefix":"10.1007","author":[{"given":"Juan","family":"Du","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","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. Congr. Numer.\u00a035, 191\u2013208 (1982)","journal-title":"Congr. Numer."},{"issue":"12","key":"36_CR2","doi-asserted-by":"publisher","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. of the IEEE\u00a068(12), 1497\u20131514 (1980)","journal-title":"Proc. of the IEEE"},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1109\/TCE.1978.266971","volume":"CE-24","author":"L.C. Middlekamp","year":"1978","unstructured":"Middlekamp, L.C.: UHF taboos-history and development. IEEE Trans. Consumer Electron.\u00a0CE-24, 514\u2013519 (1978)","journal-title":"IEEE Trans. Consumer Electron."},{"key":"36_CR4","unstructured":"Pugh, G.E., Lucas, G.L., Krupp, J.C.: Optimal allocation of TV channels-a feasibility study, Tech, Rep. DSA No.261., Decision-Science Applications, Inc., Arlington, VA (August 1981)"},{"key":"36_CR5","unstructured":"Bonias, I.: T-Colorings of complete graphs, Ph.D. Thesis, Department of Mathematics, Northeastern University, Boston, MA (1991)"},{"key":"36_CR6","unstructured":"Tesman, B.: T-colorings, list T-coloring, and set T-colorings of graphs, Ph.D. Thesis, Department of Mathematics, Rutgers University, New Brunswick, NJ (October 1989)"},{"key":"36_CR7","first-page":"115","volume":"41","author":"M.B. Cozzens","year":"1984","unstructured":"Cozzens, M.B., Wang, D.-I.: The general channel assignment problem. Congr. Number.\u00a041, 115\u2013129 (1984)","journal-title":"Congr. Number."},{"key":"36_CR8","unstructured":"Raychaudhuri, A.: Intersection assignments, T-colorings, and powers of graphs, Ph.D. Thesis, Department of Mathematics, Rutgers University, New Brunswick, NJ (1985)"},{"key":"36_CR9","unstructured":"Raychaudhuri, A.: Further results on T-colorings and frequency assignment problems. SIAM. J. Discrete Math. (to appear)"},{"key":"36_CR10","series-title":"Lecture Notes in Math.","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/BFb0066448","volume-title":"Graphs and Combinatorics","author":"S. Goodman","year":"1974","unstructured":"Goodman, S., Hedetniemi, S.: On the Hamiltonian completion problem. In: Bar, R., Harary, F. (eds.) Graphs and Combinatorics. Lecture Notes in Math., vol.\u00a0406, pp. 262\u2013274. Springer, Berlin (1974)"},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-93980-1_22","volume-title":"Approximation and Online Algorithms","author":"G. Lucarelli","year":"2009","unstructured":"Lucarelli, G., Milis, I., Paschos, V.T.: On the Maximum Edge Coloring Problem. In: Bampis, E., Skutella, M. (eds.) WAOA 2008. LNCS, vol.\u00a05426, pp. 279\u2013292. Springer, Heidelberg (2009)"},{"key":"36_CR12","series-title":"Lecture Notes in Math.","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BFb0066442","volume-title":"Graphs and Combinatories","author":"F.T. Boesch","year":"1974","unstructured":"Boesch, F.T., Chen, S., McHugh, J.A.M.: On covering the points of a graph with point disjoint paths. In: Bari, R., Harary, F. (eds.) Graphs and Combinatories. Lecture Notes in Math., vol.\u00a0406, pp. 201\u2013212. Springer, Berlin (1974)"},{"key":"36_CR13","first-page":"15","volume":"74","author":"M.A. Tesman","year":"1980","unstructured":"Tesman, M.A.: Set T-colorings of forbidden difference graphs to T-colorings. Congrussus Numerantium\u00a074, 15\u201324 (1980)","journal-title":"Congrussus Numerantium"},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"Murphey, R.A., Panos, Resende, M.G.C.: Frequency assignment problems. In: Handbook of Combinaorial Optimization. Kluwer Academic Publishers (1999)","DOI":"10.1007\/978-1-4757-3023-4_6"},{"key":"36_CR15","doi-asserted-by":"publisher","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: resent results and problems. Discrete Mathematics\u00a093, 229\u2013245 (1991)","journal-title":"Discrete Mathematics"},{"issue":"6","key":"36_CR16","doi-asserted-by":"publisher","first-page":"1685","DOI":"10.1016\/j.disc.2008.01.049","volume":"309","author":"R. Janczewski","year":"2009","unstructured":"Janczewski, R.: Greedy T-colorings of graphs. Discrete Mathematics\u00a0309(6), 1685\u20131690 (2009)","journal-title":"Discrete Mathematics"},{"issue":"5","key":"36_CR17","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1504\/IJBIC.2010.036162","volume":"2","author":"M. Aicha","year":"2010","unstructured":"Aicha, M., Malika, B., Habiba, D.: Two hybrid ant algorithms for the general T-colouring problem. International Journal of Bio-Inspired Computation\u00a02(5), 353\u2013362 (2010)","journal-title":"International Journal of Bio-Inspired Computation"},{"issue":"8","key":"36_CR18","doi-asserted-by":"publisher","first-page":"1125","DOI":"10.1002\/wcm.670","volume":"9","author":"E.G. Villegas","year":"2009","unstructured":"Villegas, E.G., Ferr\u00e9, R.V., Paradells, J.: Frequency assignments in IEEE 802.11 WLANs with efficient spectrum sharing. Wireless Communications and Mobile Computing\u00a09(8), 1125\u20131140 (2009)","journal-title":"Wireless Communications and Mobile Computing"},{"issue":"1","key":"36_CR19","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10288-008-0071-y","volume":"7","author":"E. Malaguti","year":"2009","unstructured":"Malaguti, E.: The Vertex Coloring Problem and its generalizations. 4OR: A Quarterly Journal of Operations Research\u00a07(1), 101\u2013104 (2009), doi:10.1007\/s10288-008-0071-y","journal-title":"4OR: A Quarterly Journal of Operations Research"},{"key":"36_CR20","doi-asserted-by":"crossref","unstructured":"Leila, N., Malika, B.: Resolution of the general T-coloring problem using an MBO based algorithm. In: 2011 10th IEEE International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC), pp. 438\u2013443 (2011)","DOI":"10.1109\/COGINF.2011.6016178"}],"container-title":["Lecture Notes in Computer Science","Information Computing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34062-8_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:43:29Z","timestamp":1620132209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34062-8_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642340611","9783642340628"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34062-8_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}