{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:59:55Z","timestamp":1720054795934},"reference-count":6,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"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":5280,"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":[[1999,2]]},"DOI":"10.1016\/s0012-365x(99)90073-0","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"269-284","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Irredundant and perfect neighborhood sets in graphs and claw-free graphs"],"prefix":"10.1016","volume":"197-198","author":[{"given":"Odile","family":"Favaron","sequence":"first","affiliation":[]},{"given":"Jo\u00ebl","family":"Puech","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(99)90073-0_BIB1","first-page":"213","article-title":"What makes an irredundant set maximal?","volume":"25","author":"Cockayne","year":"1997","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/S0012-365X(99)90073-0_BIB2","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0012-365X(98)00029-6","article-title":"Irredundance and perfect neighbourhood sets in trees","volume":"188","author":"Cockayne","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90073-0_BIB3","unstructured":"E.J. Cockayne, C.M. Mynhardt, On a conjecture concerning irredundant and perfect neighbourhood sets in graphs, J. Combin. Math. Combin. Comput., to appear."},{"key":"10.1016\/S0012-365X(99)90073-0_BIB4","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1002\/jgt.3190100402","article-title":"Stability, domination and irredundance in a graph","volume":"10","author":"Favaron","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(99)90073-0_BIB5","unstructured":"G.H. Fricke, T.W. Haynes, S.M. Hedetniemi, S.T. Hedetniemi, M.A. Henning, Perfect neighborhoods in graphs, submitted."},{"key":"10.1016\/S0012-365X(99)90073-0_BIB6","doi-asserted-by":"crossref","DOI":"10.1002\/(SICI)1097-0118(199812)29:4<239::AID-JGT3>3.0.CO;2-M","article-title":"Irredundance perfect and P6-free graphs","volume":"29","author":"Puech","year":"1998","journal-title":"J. graph Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99900730?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99900730?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T04:22:06Z","timestamp":1553228526000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X99900730"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":6,"alternative-id":["S0012365X99900730"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(99)90073-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}