{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T16:32:38Z","timestamp":1771518758758,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001502","name":"Department of Atomic Energy, Government of India","doi-asserted-by":"publisher","award":["02011\/10\/21NBHM-"],"award-info":[{"award-number":["02011\/10\/21NBHM-"]}],"id":[{"id":"10.13039\/501100001502","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001502","name":"Department of Atomic Energy, Government of India","doi-asserted-by":"publisher","award":["13-07-2021"],"award-info":[{"award-number":["13-07-2021"]}],"id":[{"id":"10.13039\/501100001502","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005276","name":"National Board for Higher Mathematics","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005276","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1016\/j.dam.2025.05.030","type":"journal-article","created":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T09:36:21Z","timestamp":1749548181000},"page":"38-44","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["A note on prime distance graphs with chromatic number 3 or 4"],"prefix":"10.1016","volume":"375","author":[{"given":"J.","family":"George Barnabas","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9798-8825","authenticated-orcid":false,"given":"Yegnanarayanan","family":"Venkataraman","sequence":"additional","affiliation":[]},{"given":"Bryan","family":"Freyberg","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2025.05.030_b1","unstructured":"R.B. Eggleton, New results on 3-chromatic prime distance graphs, Ars Combin. 26B, 153\u2013180."},{"key":"10.1016\/j.dam.2025.05.030_b2","first-page":"323","article-title":"Research problem 77","volume":"58","author":"Eggleton","year":"1986","journal-title":"J. Discret. Math."},{"issue":"1","key":"10.1016\/j.dam.2025.05.030_b3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01787476","article-title":"Colouring prime distance graphs","volume":"6","author":"Eggleton","year":"1990","journal-title":"Graphs Combin."},{"key":"10.1016\/j.dam.2025.05.030_b4","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0012-365X(98)00099-5","article-title":"Coloring of integer distance graphs","volume":"191","author":"Kemnitz","year":"1998","journal-title":"J. Discret. Math."},{"key":"10.1016\/j.dam.2025.05.030_b5","doi-asserted-by":"crossref","first-page":"2281","DOI":"10.1016\/j.disc.2013.06.005","article-title":"Finite prime distance graphs and 2-odd graphs","volume":"313","author":"Laison","year":"2013","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2025.05.030_b6","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/s13226-021-00135-3","article-title":"On finite prime distance graphs","volume":"52","author":"Parthiban","year":"2021","journal-title":"Indian J. Pure Appl. Math."},{"key":"10.1016\/j.dam.2025.05.030_b7","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/0012-365X(91)90454-A","article-title":"On the chromatic number of special distance graphs","volume":"97","author":"Voigt","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2025.05.030_b8","article-title":"Chromatic coloring of distance graphs II","volume":"54","author":"Yegnanarayana","year":"2021","journal-title":"J. Tianjin Univ. Sci. Technol."},{"key":"10.1016\/j.dam.2025.05.030_b9","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0012-365X(01)00221-7","article-title":"On a question concerning prime distance graphs","volume":"245","author":"Yegnanarayanan","year":"2002","journal-title":"J. Discret. Math."},{"key":"10.1016\/j.dam.2025.05.030_b10","first-page":"135","article-title":"Chromatic number of graphs with special distance sets I","volume":"17","author":"Yegnanarayanan","year":"2014","journal-title":"Algebra Discrete Math."},{"key":"10.1016\/j.dam.2025.05.030_b11","doi-asserted-by":"crossref","first-page":"31","DOI":"10.35940\/ijitee.I9291.0710921","article-title":"Chromatic coloring of distance graphs I","volume":"10","author":"Yegnanarayanan","year":"2021","journal-title":"Int. J. Innov. Technol. Explor. Eng."},{"key":"10.1016\/j.dam.2025.05.030_b12","first-page":"175","article-title":"Chromatic coloring of distance graph III","volume":"42","author":"Yegnanarayanan","year":"2022","journal-title":"Proyecciones J. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X25002859?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X25002859?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T10:30:52Z","timestamp":1762252252000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X25002859"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":12,"alternative-id":["S0166218X25002859"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2025.05.030","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2025,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A note on prime distance graphs with chromatic number 3 or 4","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2025.05.030","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}