{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T09:53:19Z","timestamp":1772790799326,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3674,"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":[[2003,8]]},"DOI":"10.1016\/s0166-218x(03)00329-9","type":"journal-article","created":{"date-parts":[[2003,7,22]],"date-time":"2003-07-22T20:46:14Z","timestamp":1058906774000},"page":"513-519","source":"Crossref","is-referenced-by-count":30,"title":["No-hole L(2,1)-colorings"],"prefix":"10.1016","volume":"130","author":[{"given":"Peter C.","family":"Fishburn","sequence":"first","affiliation":[]},{"given":"Fred S.","family":"Roberts","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(03)00329-9_BIB1","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/S0895480193245339","article-title":"The L(2,1)-labeling problem on graphs","volume":"9","author":"Chang","year":"1996","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(03)00329-9_BIB2","unstructured":"P.C. Fishburn, F.S. Roberts, Full color theorems for L(2,1)-colorings, DIMACS Technical Report 2000-08, 2000."},{"key":"10.1016\/S0166-218X(03)00329-9_BIB3","doi-asserted-by":"crossref","unstructured":"P.C. Fishburn, F.S. Roberts, Minimal forbidden graphs for L(2,1)-colorings, DIMACS Technical Report 2000-32, 2000.","DOI":"10.1016\/S0166-218X(99)00220-6"},{"key":"10.1016\/S0166-218X(03)00329-9_BIB4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1002\/(SICI)1097-0118(199605)22:1<47::AID-JGT7>3.0.CO;2-L","article-title":"On the size of graphs labeled with a condition at distance two","volume":"22","author":"Georges","year":"1996","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(03)00329-9_BIB5","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0012-365X(93)E0098-O","article-title":"Relating path coverings to vertex labelings with a condition at distance two","volume":"135","author":"Georges","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(03)00329-9_BIB6","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1137\/0405048","article-title":"Labelling graphs with a condition at distance 2","volume":"5","author":"Griggs","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(03)00329-9_BIB7","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","article-title":"Frequency assignment","volume":"68","author":"Hale","year":"1980","journal-title":"Proc. IEEE"},{"key":"10.1016\/S0166-218X(03)00329-9_BIB8","unstructured":"K. Jonas, Graph coloring analogues with a condition at distance two: L(2,1)-labelings and list \u03bb-labelings, Ph.D. Thesis, University of South Carolina, 1993."},{"key":"10.1016\/S0166-218X(03)00329-9_BIB9","first-page":"13","article-title":"On distance two labellings of graphs","volume":"47","author":"Liu","year":"1997","journal-title":"Ars Combin."},{"key":"10.1016\/S0166-218X(03)00329-9_BIB10","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0895-7177(93)90265-Z","article-title":"No-hole 2-distant colorings","volume":"17","author":"Roberts","year":"1993","journal-title":"Math. Comput. Modelling"},{"key":"10.1016\/S0166-218X(03)00329-9_BIB11","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1137\/S0895480191223178","article-title":"Labeling chordal graphs","volume":"7","author":"Sakai","year":"1994","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(03)00329-9_BIB12","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0012-365X(93)90125-D","article-title":"No-hole (r+1)-distant colorings","volume":"119","author":"Sakai","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(03)00329-9_BIB13","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/S0895480192242821","article-title":"On the \u03bb-number of Qn and related graphs","volume":"8","author":"Whittlesey","year":"1995","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(03)00329-9_BIB14","unstructured":"R.K. Yeh, Labeling graphs with a condition at distance two, Ph.D. Thesis, University of South Carolina, Columbia, SC, 1990."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03003299?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03003299?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T10:55:31Z","timestamp":1552820131000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X03003299"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0166218X03003299"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(03)00329-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}