{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T20:25:29Z","timestamp":1772828729410,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"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":[[2022,8]]},"DOI":"10.1007\/s00373-022-02508-9","type":"journal-article","created":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T15:13:02Z","timestamp":1654787582000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Well-Edge-Dominated Graphs"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9645-2313","authenticated-orcid":false,"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":[[2022,6,9]]},"reference":[{"issue":"2","key":"2508_CR1","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/s00453-007-9057-y","volume":"50","author":"A Berger","year":"2008","unstructured":"Berger, A., Parekh, O.: Linear time algorithms for generalized edge dominating set problems. Algorithmica 50(2), 244\u2013254 (2008)","journal-title":"Algorithmica"},{"issue":"3","key":"2508_CR2","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1002\/jgt.22750","volume":"99","author":"Y B\u00fcy\u00fck\u00e7olak","year":"2022","unstructured":"B\u00fcy\u00fck\u00e7olak, Y., G\u00f6z\u00fcpek, D., \u00d6zkan, S.: Triangle-free equimatchable graphs. J. Graph Theory 99(3), 461\u2013484 (2022)","journal-title":"J. Graph Theory"},{"key":"2508_CR3","first-page":"5","volume":"25A","author":"A Finbow","year":"1988","unstructured":"Finbow, A., Hartnell, B., Nowakowski, R.: Well-dominated graphs: a collection of well-covered ones. Ars Comb. 25A, 5\u201310 (1988)","journal-title":"Ars Comb."},{"key":"2508_CR4","first-page":"185","volume":"46","author":"A Frendrup","year":"2010","unstructured":"Frendrup, A., Hartnell, B., Vestergaard, P.L.: A note on equimatchable graphs. Aust. J. Comb. 46, 185\u2013190 (2010)","journal-title":"Aust. J. Comb."},{"issue":"3","key":"2508_CR5","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1137\/0406030","volume":"6","author":"JD Horton","year":"1993","unstructured":"Horton, J.D., Kilakos, K.: Minimum edge dominating sets. SIAM J. Discrete Math. 6(3), 375\u2013387 (1993)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"2508_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.7151\/dmgt.1006","volume":"15","author":"SF Hwang","year":"1995","unstructured":"Hwang, S.F., Chang, G.J.: The edge domination problem. Discuss. Math. Graph Theory 15(1), 51\u201357 (1995)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2508_CR7","unstructured":"Lesk, M., Plummer, M.D., Pulleyblank, W.R.: Equi-matchable graphs. In: Graph Theory and Combinatorics, pp. 239\u2013254. Academic Press, London (1984)"},{"key":"2508_CR8","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02760842","volume":"18","author":"M Lewin","year":"1974","unstructured":"Lewin, M.: Matching-perfect and cover-perfect graphs. Isr. J. Math. 18, 345\u2013347 (1974)","journal-title":"Isr. J. Math."},{"key":"2508_CR9","unstructured":"Meng, D.H.-C.: Matching and coverings for graphs. Ph.D.\u00a0Thesis, Michigan State University, East Lansing, MI (1974)"},{"key":"2508_CR10","first-page":"489","volume":"19","author":"S Mitchell","year":"1977","unstructured":"Mitchell, S., Hedetniemi, S.: Edge domination in trees. Congr. Numer. 19, 489\u2013509 (1977)","journal-title":"Congr. Numer."},{"issue":"2","key":"2508_CR11","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1002\/jgt.3190030209","volume":"3","author":"DP Sumner","year":"1979","unstructured":"Sumner, D.P.: Randomly matchable graphs. J. Graph Theory 3(2), 183\u2013186 (1979)","journal-title":"J. Graph Theory"},{"issue":"3","key":"2508_CR12","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0138030","volume":"38","author":"M Yannakakis","year":"1980","unstructured":"Yannakakis, M., Gavril, F.: Edge dominating sets in graphs. SIAM J. Appl. Math. 38(3), 364\u2013372 (1980)","journal-title":"SIAM J. Appl. Math."},{"key":"2508_CR13","unstructured":"Yildiz, M.A.: Linear time recognition of equimatchable split graphs. arXiv: 1911.04277"}],"updated-by":[{"DOI":"10.1007\/s00373-022-02556-1","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T00:00:00Z","timestamp":1664236800000}}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02508-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02508-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02508-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T08:37:54Z","timestamp":1664354274000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02508-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["2508"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02508-9","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s00373-022-02556-1","asserted-by":"object"}]},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"14 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2022","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s00373-022-02556-1","URL":"https:\/\/doi.org\/10.1007\/s00373-022-02556-1","order":8,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"106"}}