{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:27Z","timestamp":1759063587166},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"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":6438,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1995,12]]},"DOI":"10.1016\/0166-218x(94)00073-9","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"267-276","source":"Crossref","is-referenced-by-count":6,"title":["Well irredundant graphs"],"prefix":"10.1016","volume":"63","author":[{"given":"Jerzy","family":"Topp","sequence":"first","affiliation":[]},{"given":"Preben D.","family":"Vestergaard","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)00073-9_BIB1","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/jgt.3190030306","article-title":"Graph-theoretic parameters concerning domination, independence and irredundance","volume":"3","author":"Bollob\u00e1s","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/0166-218X(94)00073-9_BIB2","series-title":"Graphs and Digraphs","author":"Chartrand","year":"1986"},{"key":"10.1016\/0166-218X(94)00073-9_BIB3","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/net.3230070305","article-title":"Towards a theory of domination in graphs","volume":"7","author":"Cockayne","year":"1977","journal-title":"Networks"},{"key":"10.1016\/0166-218X(94)00073-9_BIB4","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0012-365X(88)90192-6","article-title":"Gallai theorems for graphs, hypergraphs, and set systems","volume":"72","author":"Cockayne","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(94)00073-9_BIB5","doi-asserted-by":"crossref","first-page":"461","DOI":"10.4153\/CMB-1978-079-5","article-title":"Properties of hereditary hypergraphs and middle graphs","volume":"21","author":"Cockayne","year":"1978","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0166-218X(94)00073-9_BIB6","first-page":"5","article-title":"Well-dominated graphs: a collection of well-covered ones","volume":"25A","author":"Finbow","year":"1988","journal-title":"Ars Combin."},{"key":"10.1016\/0166-218X(94)00073-9_BIB7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF01848079","article-title":"On graphs having domination number half their order","volume":"16","author":"Fink","year":"1985","journal-title":"Period. Math. Hunger."},{"key":"10.1016\/0166-218X(94)00073-9_BIB8","first-page":"183","article-title":"Irredundance in graphs: a survey","volume":"48","author":"Hedetniemi","year":"1985"},{"key":"10.1016\/0166-218X(94)00073-9_BIB9","first-page":"308","article-title":"On domination related concepts in graph theory","volume":"885","author":"Laskar","year":"1981"},{"key":"10.1016\/0166-218X(94)00073-9_BIB10","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1093\/imamat\/14.2.183","article-title":"Two bounds for the domination number of graph","volume":"14","author":"Nieminen","year":"1974","journal-title":"J. Inst. Math. Appl."},{"key":"10.1016\/0166-218X(94)00073-9_BIB11","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0021-9800(70)80011-4","article-title":"Some covering concepts in graphs","volume":"8","author":"Plummer","year":"1970","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0166-218X(94)00073-9_BIB12","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1080\/16073606.1993.9631737","article-title":"Well-covered graphs: a survey","volume":"16","author":"Plummer","year":"1993","journal-title":"Quaest. Math."},{"key":"10.1016\/0166-218X(94)00073-9_BIB13","doi-asserted-by":"crossref","unstructured":"E. Prisner, J. Topp and P.D. Vestergaard, Well covered simplicial, chordal and circular arc graphs, J. Graph Theory, to appear.","DOI":"10.1002\/(SICI)1097-0118(199602)21:2<113::AID-JGT1>3.0.CO;2-U"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94000739?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94000739?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T03:56:15Z","timestamp":1555300575000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94000739"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["0166218X94000739"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)00073-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}