{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T20:39:04Z","timestamp":1772829544770,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,9,25]],"date-time":"2020-09-25T00:00:00Z","timestamp":1600992000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,25]],"date-time":"2020-09-25T00:00:00Z","timestamp":1600992000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s00373-020-02235-z","type":"journal-article","created":{"date-parts":[[2020,9,25]],"date-time":"2020-09-25T13:04:16Z","timestamp":1601039056000},"page":"151-165","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On Well-Dominated Graphs"],"prefix":"10.1007","volume":"37","author":[{"given":"Sarah E.","family":"Anderson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kirsti","family":"Kuenzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5482-756X","authenticated-orcid":false,"given":"Douglas F.","family":"Rall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,25]]},"reference":[{"key":"2235_CR1","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1002\/jgt.3190030306","volume":"3","author":"B Bollob\u00e1s","year":"1979","unstructured":"Bollob\u00e1s, B., Cockayne, E.: Graph theoretic parameters concerning domination, independence and irredundance. J. Graph Theory 3, 241\u2013250 (1979)","journal-title":"J. Graph Theory"},{"issue":"13","key":"2235_CR2","doi-asserted-by":"publisher","first-page":"1636","DOI":"10.1016\/j.disc.2006.09.013","volume":"307","author":"B Bre\u0161ar","year":"2007","unstructured":"Bre\u0161ar, B., Klav\u017ear, S., Rall, D.F.: Dominating direct products of graphs. Discrete Math. 307(13), 1636\u20131642 (2007)","journal-title":"Discrete Math."},{"key":"2235_CR3","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1006\/jctb.1993.1005","volume":"57","author":"A Finbow","year":"1993","unstructured":"Finbow, A., Hartnell, B., Nowakowski, R.: A characterization of well-covered graphs of girth $$5$$ or greater. J. Combin. Theory Ser. B 57, 44\u201368 (1993)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2235_CR4","first-page":"5","volume":"25","author":"A Finbow","year":"1988","unstructured":"Finbow, A., Hartnell, B., Nowakowski, R.: Well-dominated graphs: a collection of well-covered ones. Ars Combin. 25, 5\u201310 (1988)","journal-title":"Ars Combin."},{"key":"2235_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman & Co., New York (1979)"},{"issue":"12","key":"2235_CR6","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1016\/j.dam.2011.04.013","volume":"159","author":"TJ Gionet Jr","year":"2011","unstructured":"Gionet Jr., T.J., King, E.L.C., Sha, Y.: A revision and extension of results on $$4$$-regular, $$4$$-connected, claw-free graphs. Discrete Appl. Math. 159(12), 1225\u20131230 (2011)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"2235_CR7","first-page":"17","volume":"19","author":"D G\u00f6z\u00fcpek","year":"2017","unstructured":"G\u00f6z\u00fcpek, D., Hujdurovi\u0107, A., Milani\u010d, M.: Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs. Discrete Math. Theor. Comput. Sci. 19(1), 17 (2017)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"2","key":"2235_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.37236\/2299","volume":"20","author":"B Hartnell","year":"2013","unstructured":"Hartnell, B., Rall, D.F.: On the Cartesian product of non well-covered graphs. Electron. J. Combin. 20(2), 1\u20134 (2013)","journal-title":"Electron. J. Combin."},{"issue":"6","key":"2235_CR9","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1007\/s00373-018-1943-3","volume":"34","author":"B Hartnell","year":"2018","unstructured":"Hartnell, B., Rall, D.F., Wash, K.: On well-covered Cartesian products. Graphs Combin. 34(6), 1259\u20131268 (2018)","journal-title":"Graphs Combin."},{"key":"2235_CR10","unstructured":"Kuenzel, K., Rall, D.\u00a0F.: On well-covered direct products, Discuss. Math. Graph Theory, to appear, 14 pp"},{"issue":"80","key":"2235_CR11","doi-asserted-by":"publisher","first-page":"1793","DOI":"10.1016\/j.disc.2017.02.021","volume":"340","author":"VE Levit","year":"2017","unstructured":"Levit, V.E., Tankus, D.: Well-dominated graphs without cycles of lengths 4 and 5. Discrete Math. 340(80), 1793\u20131801 (2017)","journal-title":"Discrete Math."},{"key":"2235_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/jgt.3190060104","volume":"6","author":"C Payan","year":"1982","unstructured":"Payan, C., Xuong, N.H.: Domination-balanced graphs. J. Graph Theory 6, 23\u201332 (1982)","journal-title":"J. Graph Theory"},{"key":"2235_CR13","first-page":"253","volume":"8","author":"M Plummer","year":"1970","unstructured":"Plummer, M.: Some covering concepts in graphs. J. Comb. Theory 8, 253\u2013287 (1970)","journal-title":"J. Comb. Theory"},{"issue":"2","key":"2235_CR14","first-page":"55","volume":"1","author":"J Topp","year":"1990","unstructured":"Topp, J., Volkmann, L.: Well covered and well dominated block graphs and unicyclic graphs. Math. Pannon. 1(2), 55\u201366 (1990)","journal-title":"Math. Pannon."},{"key":"2235_CR15","first-page":"199","volume":"33","author":"J Topp","year":"1992","unstructured":"Topp, J., Volkmann, L.: On the well-coveredness of products of graphs. Ars Combin. 33, 199\u2013215 (1992)","journal-title":"Ars Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02235-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-020-02235-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02235-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,25]],"date-time":"2021-09-25T00:12:00Z","timestamp":1632528720000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-020-02235-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,25]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["2235"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02235-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,25]]},"assertion":[{"value":"21 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}