{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T20:49:13Z","timestamp":1771879753417,"version":"3.50.1"},"reference-count":44,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"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":5737,"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":[[1997,11]]},"DOI":"10.1016\/s0012-365x(96)00356-1","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T18:23:46Z","timestamp":1051727026000},"page":"43-61","source":"Crossref","is-referenced-by-count":8,"title":["Using maximality and minimality conditions to construct inequality chains"],"prefix":"10.1016","volume":"176","author":[{"given":"E.J.","family":"Cockayne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.H.","family":"Hattingh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.M.","family":"Hedetniemi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.T.","family":"Hedetniemi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.A.","family":"McRae","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00356-1_BIB1","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/jgt.3190010209","article-title":"Total matchings and total coverings of graphs","volume":"1","author":"Alavi","year":"1977","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0012-365X(78)90105-X","article-title":"On domination and independent domination of a graph","volume":"23","author":"Allan","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00356-1_BIB3","series-title":"Theory of Graphs and its Applications","author":"Berge","year":"1958"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB4","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB5","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0196-6774(87)90039-3","article-title":"Linear time computation of optimal subgraphs of decomposable graphs","volume":"8","author":"Bern","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB6","series-title":"Graphs and Digraphs","author":"Chartrand","year":"1986"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0166-218X(94)90011-6","article-title":"Classes of graphs for which upper fractional domination equals independence, upper domination and upper irredundance","volume":"55","author":"Cheston","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(96)00356-1_BIB8","first-page":"217","article-title":"Bounds for the domination number of grid graphs","volume":"47","author":"Cockayne","year":"1985"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB9","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\/S0012-365X(96)00356-1_BIB10","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\/S0012-365X(96)00356-1_BIB11","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\/S0012-365X(96)00356-1_BIB12","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\/S0012-365X(96)00356-1_BIB13","first-page":"195","article-title":"k-minimal domination numbers of cycles","volume":"23A","author":"Cockayne","year":"1987","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(96)00356-1_BIB14","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0012-365X(93)90288-5","article-title":"The sequence of upper and lower domination, independence and irredundance numbers of a graph","volume":"122","author":"Cockayne","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00356-1_BIB15","first-page":"227","article-title":"Fractional packings, coverings and irredundance in graphs","volume":"66","author":"Domke","year":"1988"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB16","first-page":"371","article-title":"Relationships between integer and fractional parameters of graphs","volume":"vol. I","author":"Domke","year":"1988"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB17","first-page":"5","article-title":"Well-dominated graphs: a collection of well-covered ones","volume":"25 A","author":"Finbow","year":"1988","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(96)00356-1_BIB18","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1006\/jctb.1993.1005","article-title":"A characterization of well-covered graph of girth five or greater","volume":"57","author":"Finbow","year":"1993","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB19","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1002\/jgt.3190180707","article-title":"A characterization of well-covered graphs which contain neither 4- nor 5-cycles","volume":"18","author":"Finbow","year":"1994","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB20","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1137\/S0895480191199026","article-title":"The private neighbor cube","volume":"7","author":"Fellows","year":"1994","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0012-365X(96)00356-1_BIB21","series-title":"manuscript","article-title":"On the equivalence of the upper irredundance and fractional irredundance numbers of a graph","author":"Fricke","year":"1988"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB22","first-page":"507","article-title":"Combinatorial problems on chessboards: a brief survey","volume":"Vol. 1","author":"Fricke","year":"1995"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB23","first-page":"133","article-title":"\u00dcber extreme Punkt und Kantenmengen","volume":"2","author":"Gallai","year":"1959","journal-title":"Ann. Univ. Sci. Budapest E\u00f6tv\u00f6s Sect. Math."},{"key":"10.1016\/S0012-365X(96)00356-1_BIB24","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB25","first-page":"621","article-title":"Recent results and unsolved problems in hypercube theory","volume":"vol. 2","author":"Harary","year":"1991"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB26","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0898-1221(88)90213-1","article-title":"A survey of the theory of hypercube graphs","volume":"15","author":"Harary","year":"1988","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/S0012-365X(96)00356-1_BIB27","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0893-9659(93)90027-K","article-title":"Independent domination in hypercubes","volume":"6","author":"Harary","year":"1993","journal-title":"Appl. Math. Lett."},{"key":"10.1016\/S0012-365X(96)00356-1_BIB28","first-page":"145","article-title":"The complexity of upper distance irredundance","volume":"39","author":"Hattingh","year":"1991"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.3190180102","article-title":"The ratio of distance irredundance and domination numbers","volume":"18","author":"Hattingh","year":"1994","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB30","first-page":"147","article-title":"Private domination: theory and algorithms","volume":"79","author":"Hedetniemi","year":"1990"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB31","first-page":"671","article-title":"Domination, independence and irredundance in total graphs: a brief survey","volume":"Vol. 2","author":"Hedetniemi","year":"1995"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB32","first-page":"23","article-title":"A max-min relationship between matchings and domination in graphs","volume":"40","author":"Hedetniemi","year":"1983"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB33","series-title":"working paper","article-title":"Iterated domination, independence and irredundance in graphs","author":"Hedetniemi","year":"1995"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB34","doi-asserted-by":"crossref","unstructured":"M.A. Henning, O.R. Oellermann and H.C. Swart, The diversity of domination, Discrete Math., to appear.","DOI":"10.1016\/0012-365X(95)00074-7"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB35","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1137\/0406030","article-title":"Minimum edge dominating sets","volume":"6","author":"Horton","year":"1993","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0012-365X(96)00356-1_BIB36","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0166-218X(93)90224-C","article-title":"A note on graphs which have upper irredundance equal to independence","volume":"44","author":"Jacobson","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(96)00356-1_BIB37","first-page":"639","article-title":"Strong independence in graphs","volume":"29","author":"McFall","year":"1980"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB38","article-title":"Generalizing NP-completeness proofs for bipartite and chordal graphs","author":"McRae","year":"1994"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB39","series-title":"25th Southeastern Conf. on Combinatorics, Graph Theory and Computing","article-title":"External redundant set in graphs, talk","author":"McRae","year":"1994"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB40","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1093\/imamat\/14.2.183","article-title":"Two bounds for the domination number of a graph","volume":"14","author":"Nieminen","year":"1974","journal-title":"J. Inst. Math. Appl."},{"key":"10.1016\/S0012-365X(96)00356-1_BIB41","article-title":"Theory of graphs","volume":"38","author":"Ore","year":"1962"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB42","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\/S0012-365X(96)00356-1_BIB43","doi-asserted-by":"crossref","first-page":"197","DOI":"10.6028\/jres.082.019","article-title":"Enclaveless sets and MK-systems","volume":"82","author":"Slater","year":"1977","journal-title":"J. Res. Natl. Bureau of Standards"},{"key":"10.1016\/S0012-365X(96)00356-1_BIB44","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1002\/jgt.3190030211","article-title":"On some subclasses of well-covered graphs","volume":"3","author":"Staples","year":"1979","journal-title":"J. Graph Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96003561?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96003561?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T19:22:26Z","timestamp":1556652146000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96003561"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":44,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S0012365X96003561"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00356-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}