{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:02Z","timestamp":1759637822723},"reference-count":10,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2009,8,1]],"date-time":"2009-08-01T00:00:00Z","timestamp":1249084800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1016\/j.endm.2009.07.097","type":"journal-article","created":{"date-parts":[[2009,7,31]],"date-time":"2009-07-31T17:14:36Z","timestamp":1249060476000},"page":"585-588","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Identifying Codes in Trees and Planar Graphs"],"prefix":"10.1016","volume":"34","author":[{"given":"David","family":"Auger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.endm.2009.07.097_bib001","unstructured":"D. Auger, Minimal identifying codes in trees and planar graphs with large girth, submitted"},{"key":"10.1016\/j.endm.2009.07.097_bib002","unstructured":"D. Auger, I. Charon, O. Hudry and A. Lobstein, Complexity results for identifying codes in planar graphs, submitted"},{"key":"10.1016\/j.endm.2009.07.097_bib003","series-title":"Graph theory","author":"Bondy","year":"2008"},{"key":"10.1016\/j.endm.2009.07.097_bib004","doi-asserted-by":"crossref","first-page":"2109","DOI":"10.1016\/S0304-3975(02)00536-4","article-title":"Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard","volume":"290","author":"Charon","year":"2003","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.endm.2009.07.097_bib005","series-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"issue":"1","key":"10.1016\/j.endm.2009.07.097_bib006","doi-asserted-by":"crossref","DOI":"10.37236\/1910","article-title":"Construction of codes identifying sets of vertices","volume":"12","author":"Gravier","year":"2005","journal-title":"Electronic Journal of Combinatorics"},{"key":"10.1016\/j.endm.2009.07.097_bib007","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1109\/18.661507","article-title":"On a new class of codes for identifying vertices in graphs","volume":"44","author":"Karpovsky","year":"1998","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/j.endm.2009.07.097_bib008","first-page":"81","article-title":"On graphs admitting codes identifying sets of vertices","volume":"41","author":"Laihonen","year":"2008","journal-title":"Australasian Journal of Combinatorics"},{"key":"10.1016\/j.endm.2009.07.097_bib009","first-page":"82","article-title":"Codes identifying sets of vertices","volume":"No. 2227","author":"Laihonen","year":"2001"},{"key":"10.1016\/j.endm.2009.07.097_bib010","author":"Lobstein"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1571065309001395?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1571065309001395?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,5,21]],"date-time":"2020-05-21T04:03:05Z","timestamp":1590033785000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065309001395"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":10,"alternative-id":["S1571065309001395"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.endm.2009.07.097","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2009,8]]}}}