{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T14:33:14Z","timestamp":1774967594271,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"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":4794,"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":[[2000,6]]},"DOI":"10.1016\/s0166-218x(99)00220-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:49:34Z","timestamp":1027604974000},"page":"189-204","source":"Crossref","is-referenced-by-count":3,"title":["Interference patterns in bijective colorings of 2-regular graphs"],"prefix":"10.1016","volume":"102","author":[{"given":"Peter","family":"Fishburn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul E.","family":"Wright","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00220-6_BIB1","unstructured":"I. Bonias, T-colorings of complete graphs, Ph.D. Thesis, Northeastern University, Boston, MA, 1991."},{"key":"10.1016\/S0166-218X(99)00220-6_BIB2","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(99)00220-6_BIB3","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1137\/S089548019427545X","article-title":"Interference-minimizing colorings of regular graphs","volume":"11","author":"Fishburn","year":"1998","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(99)00220-6_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":"A 68","author":"Griggs","year":"1994","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0166-218X(99)00220-6_BIB5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(95)00108-4","article-title":"No-hole k-tuple (r+1)-distant colorings of odd cycles","volume":"64","author":"Guichard","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00220-6_BIB6","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1137\/0405012","article-title":"Pair labellings of graphs","volume":"5","author":"Guichard","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(99)00220-6_BIB7","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","article-title":"Frequency assignment: theory and application","volume":"68","author":"Hale","year":"1980","journal-title":"Proc. IEEE"},{"key":"10.1016\/S0166-218X(99)00220-6_BIB8","unstructured":"D.-F. Liu, Graph homomorphisms and the channel assignment problem, Ph.D. Thesis, University of South Carolina, Columbia, SC, 1991."},{"key":"10.1016\/S0166-218X(99)00220-6_BIB9","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1137\/S0895480189171746","article-title":"Further results on T-coloring and frequency assignment problems","volume":"7","author":"Raychaudhuri","year":"1994","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(99)00220-6_BIB10","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\/S0166-218X(99)00220-6_BIB11","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0166-218X(93)90015-G","article-title":"List T-colorings of graphs","volume":"45","author":"Tesman","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00220-6_BIB12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0166-218X(94)00030-H","article-title":"No-hole k-tuple (r+1)-distant colorings of odd cycles","volume":"64","author":"Troxell","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00220-6_BIB13","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1002\/jgt.3190120411","article-title":"Star chromatic number","volume":"12","author":"Vince","year":"1988","journal-title":"J. Graph Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99002206?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99002206?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T01:51:01Z","timestamp":1556502661000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99002206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0166218X99002206"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00220-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}