{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T16:51:18Z","timestamp":1768323078485,"version":"3.49.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,6,12]],"date-time":"2021-06-12T00:00:00Z","timestamp":1623456000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,12]],"date-time":"2021-06-12T00:00:00Z","timestamp":1623456000000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10878-021-00764-8","type":"journal-article","created":{"date-parts":[[2021,6,12]],"date-time":"2021-06-12T14:14:30Z","timestamp":1623507270000},"page":"2482-2498","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A new lower bound for the eternal vertex cover number of graphs"],"prefix":"10.1007","volume":"44","author":[{"given":"Jasine","family":"Babu","sequence":"first","affiliation":[]},{"given":"Veena","family":"Prabhakaran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,12]]},"reference":[{"key":"764_CR1","first-page":"275","volume":"91","author":"M Anderson","year":"2014","unstructured":"Anderson M, Carrington JR, Brigham RC, Dutton R, Vitray RP (2014) Graphs simultaneously achieving three vertex cover numbers. J Comb Math Comb Comput 91:275\u2013290","journal-title":"J Comb Math Comb Comput"},{"key":"764_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2021.02.004","author":"J Babu","year":"2021","unstructured":"Babu J, Chandran LS, Francis M, Prabhakaran V, Rajendraprasad D, Warrier NJ (2021) On graphs whose eternal vertex cover number and vertex cover number coincide. Discrete Appl Math. https:\/\/doi.org\/10.1016\/j.dam.2021.02.004","journal-title":"Discrete Appl Math"},{"issue":"1","key":"764_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"BS Baker","year":"1994","unstructured":"Baker BS (1994) Approximation algorithms for NP-complete problems on planar graphs. J ACM 41(1):153\u2013180","journal-title":"J ACM"},{"issue":"2","key":"764_CR4","doi-asserted-by":"publisher","first-page":"158","DOI":"10.21136\/CPM.1974.117838","volume":"99","author":"G Chartrand","year":"1974","unstructured":"Chartrand G, Pippert RE (1974) Locally connected graphs. \u010casopis prop\u011bstov\u00e1n\u00ed matematiky 99(2):158\u2013163","journal-title":"\u010casopis prop\u011bstov\u00e1n\u00ed matematiky"},{"issue":"16","key":"764_CR5","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.ipl.2010.05.029","volume":"110","author":"FV Fomin","year":"2010","unstructured":"Fomin FV, Gaspers S, Golovach PA, Kratsch D, Saurabh S (2010) Parameterized algorithm for eternal vertex cover. Inf Process Lett 110(16):702\u2013706","journal-title":"Inf Process Lett"},{"key":"764_CR6","first-page":"169","volume":"52","author":"W Goddard","year":"2005","unstructured":"Goddard W, Hedetniemi SM, Hedetniemi ST (2005) Eternal security in graphs. J Combin Math Combin Comput 52:169\u2013180","journal-title":"J Combin Math Combin Comput"},{"issue":"12","key":"764_CR7","doi-asserted-by":"publisher","first-page":"2589","DOI":"10.1016\/j.disc.2007.06.005","volume":"308","author":"JL Goldwasser","year":"2008","unstructured":"Goldwasser JL, Klostermeyer WF (2008) Tight bounds for eternal dominating sets in graphs. Discrete Math 308(12):2589\u20132593","journal-title":"Discrete Math"},{"key":"764_CR8","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.disc.2014.07.011","volume":"335","author":"B Hartnell","year":"2014","unstructured":"Hartnell B, Mynhardt C (2014) Independent protection in graphs. Discrete Math 335:100\u2013109","journal-title":"Discrete Math"},{"key":"764_CR9","first-page":"235","volume":"45","author":"WF Klostermeyer","year":"2009","unstructured":"Klostermeyer WF, Mynhardt CM (2009) Edge protection in graphs. Aust J Comb 45:235\u2013250","journal-title":"Aust J Comb"},{"key":"764_CR10","doi-asserted-by":"publisher","first-page":"1371","DOI":"10.1016\/j.disc.2011.03.026","volume":"311","author":"WF Klostermeyer","year":"2011","unstructured":"Klostermeyer WF, Mynhardt CM (2011) Graphs with equal eternal vertex cover and eternal domination numbers. Discrete Math 311:1371\u20131379","journal-title":"Discrete Math"},{"issue":"7","key":"764_CR11","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1016\/j.dam.2011.11.034","volume":"160","author":"WF Klostermeyer","year":"2012","unstructured":"Klostermeyer WF, Mynhardt CM (2012) Vertex covers and eternal dominating sets. Discrete Appl Math 160(7):1183\u20131190","journal-title":"Discrete Appl Math"},{"key":"764_CR12","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.ipl.2019.01.013","volume":"146","author":"M Rinemberg","year":"2019","unstructured":"Rinemberg M, Soulignac FJ (2019) The eternal dominating set problem for interval graphs. Inf Process Lett 146:27\u201329","journal-title":"Inf Process Lett"},{"issue":"2","key":"764_CR13","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose DJ, Tarjan RE, Lueker GS (1976) Algorithmic aspects of vertex elimination on graphs. SIAM J Comput 5(2):266\u2013283","journal-title":"SIAM J Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00764-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00764-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00764-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T20:19:21Z","timestamp":1665778761000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00764-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,12]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["764"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00764-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,12]]},"assertion":[{"value":"31 May 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}