{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T20:49:11Z","timestamp":1771879751268,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6713,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1995,3]]},"DOI":"10.1016\/0012-365x(94)00205-w","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:25:26Z","timestamp":1049721926000},"page":"229-246","source":"Crossref","is-referenced-by-count":13,"title":["Nearly perfect sets in graphs"],"prefix":"10.1016","volume":"138","author":[{"given":"Jean E.","family":"Dunbar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frederick C.","family":"Harris Jr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandra M.","family":"Hedetniemi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen T.","family":"Hedetniemi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alice A.","family":"McRae","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renu C.","family":"Laskar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)00205-W_BIB1","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0012-365X(90)90352-I","article-title":"On generalized minimal domination parameters for paths","volume":"86","author":"Bollob\u00e1s","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00205-W_BIB2","unstructured":"E.J. Cockayne, B.L. Hartnell, S.T. Hedetniemi and R. Laskar, Perfect domination in graphs, to appear in: J. Combin. Inform. Systems Sci."},{"key":"10.1016\/0012-365X(94)00205-W_BIB3","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0022-0000(79)90053-9","article-title":"Linear algorithms on recursive representations of trees","volume":"18","author":"Cockayne","year":"1979","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0012-365X(94)00205-W_BIB4","first-page":"118","article-title":"On the product of k-minimal domination numbers of a graph and its complement","volume":"8","author":"Cockayne","year":"1990","journal-title":"J. Comb. Math. Comb. Computing"},{"key":"10.1016\/0012-365X(94)00205-W_BIB5","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1080\/16073606.1990.9631607","article-title":"Generalized maximal independence parameters for paths and cycles","volume":"13","author":"Cockayne","year":"1990","journal-title":"Quaestiones Math."},{"key":"10.1016\/0012-365X(94)00205-W_BIB6","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0012-365X(94)00205-W_BIB7","series-title":"Proc. of the Japan-U.S. Joint Seminar","first-page":"437","article-title":"Linear time computability of combinatorial problems on generalized-series-parallel graphs, Discrete Algorithms and Complexity","volume":"Vol. 15","author":"Hare","year":"1987"},{"issue":"4","key":"10.1016\/0012-365X(94)00205-W_BIB8","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0020-0190(91)90188-N","article-title":"On approximating the minimum independent dominating set","volume":"37","author":"Irving","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0012-365X(94)00205-W_BIB9","article-title":"Algorithms on trees and maximal outerplanar graphs: design, complexity analysis and data structures study","author":"Mitchell","year":"1977"},{"key":"10.1016\/0012-365X(94)00205-W_BIB10","article-title":"Linear algorithms on k-terminal graphs","author":"Wimer","year":"1987"},{"key":"10.1016\/0012-365X(94)00205-W_BIB11","first-page":"43","article-title":"A methodology for constructing linear graph algorithms","volume":"50","author":"Wimer","year":"1985"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400205W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400205W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:21:40Z","timestamp":1556115700000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9400205W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":11,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["0012365X9400205W"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)00205-w","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}