{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T20:32:15Z","timestamp":1758054735339,"version":"3.44.0"},"reference-count":8,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5252,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1999,3]]},"DOI":"10.1016\/s0012-365x(98)00304-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:14:12Z","timestamp":1027602852000},"page":"233-236","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"title":["A characterization of uniquely vertex colorable graphs using minimal defining sets"],"prefix":"10.1016","volume":"199","author":[{"given":"H.","family":"Hajiabolhassan","sequence":"first","affiliation":[]},{"given":"M.L.","family":"Mehrabadi","sequence":"additional","affiliation":[]},{"given":"R.","family":"Tusserkani","sequence":"additional","affiliation":[]},{"given":"M.","family":"Zaker","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00304-5_BIB1","article-title":"External Graph Theory","volume":"vol. 11","author":"Bollob\u00e1s","year":"1978"},{"year":"1976","series-title":"Graph Theory with Applications","author":"Bondy","key":"10.1016\/S0012-365X(98)00304-5_BIB2"},{"article-title":"Uniquely Colorable Graphs","year":"1976","author":"Daneshgar","key":"10.1016\/S0012-365X(98)00304-5_BIB3"},{"key":"10.1016\/S0012-365X(98)00304-5_BIB4","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1016\/S0021-9800(69)80086-4","article-title":"Uniquely Colorable Graphs","volume":"6","author":"Harary","year":"1969","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0012-365X(98)00304-5_BIB5","series-title":"Proc. 26th Annual Iranian Math. Conf.","first-page":"215","article-title":"Some Problems in Graph Colorings","author":"Mahmoodian","year":"1995"},{"key":"10.1016\/S0012-365X(98)00304-5_BIB6","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/S0012-365X(96)00247-6","article-title":"Defining Sets in Vertex Coloring of Graphs and Latin Rectangles","volume":"167\/168","author":"Mahmoodian","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00304-5_BIB7","first-page":"733","article-title":"Results on uniquely colorable graphs","volume":"37","author":"Truszczy\u0144ski","year":"1981"},{"year":"1992","series-title":"A Course in Combinatorics","author":"Van Lint","key":"10.1016\/S0012-365X(98)00304-5_BIB8"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98003045?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98003045?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T06:03:44Z","timestamp":1757916224000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98003045"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":8,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["S0012365X98003045"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00304-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[1999,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A characterization of uniquely vertex colorable graphs using minimal defining sets","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0012-365X(98)00304-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}