{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:16Z","timestamp":1720640836248},"reference-count":7,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"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":[[2000,7]]},"DOI":"10.1016\/s1571-0653(05)80142-8","type":"journal-article","created":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T11:08:52Z","timestamp":1114945732000},"page":"123-125","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Graphs with unique dominating sets"],"prefix":"10.1016","volume":"5","author":[{"given":"Miranca","family":"Fischermann","sequence":"first","affiliation":[]},{"given":"Lutz","family":"Volkmann","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(05)80142-8_BIB1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","article-title":"Characterisations of strongly chordal graphs","volume":"43","author":"Farber","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/S1571-0653(05)80142-8_BIB2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(84)90061-1","article-title":"Domination, independent domination, and duality in strongly chordal graphs","volume":"7","author":"Farber","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S1571-0653(05)80142-8_BIB3","first-page":"55","article-title":"Graphs with unique minimum dominating sets","volume":"101","author":"Gunther","year":"1994","journal-title":"Congr. Numer."},{"key":"10.1016\/S1571-0653(05)80142-8_BIB4","series-title":"Fundamentals of domination in graphs","author":"Haynes","year":"1998"},{"key":"10.1016\/S1571-0653(05)80142-8_BIB5","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0166-218X(86)90089-2","article-title":"A linear algorithm for finding a minimum dominating set in a cactus","volume":"13","author":"Hedetniemi","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S1571-0653(05)80142-8_BIB6","first-page":"667","article-title":"Simple reduction theorems for finding minimum coverings and minimum dominating sets. Contemporary Methods in Graph Theory. In honour of Prof. Dr. Klaus Wagner","author":"Volkmann","year":"1990"},{"key":"10.1016\/S1571-0653(05)80142-8_BIB7","first-page":"6 pages","article-title":"A reduction principle concerning minimum dominating sets in graphs","volume":"31","author":"Volkmann","year":"1999","journal-title":"JCMCC"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801428?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801428?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T19:58:06Z","timestamp":1548532686000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065305801428"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":7,"alternative-id":["S1571065305801428"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80142-8","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}