A substructure based lower bound for eternal vertex cover number

DOI10.1016/j.tcs.2021.08.018OpenAlexW3194962824MaRDI QIDQ2235736

Jasine Babu, Arko Sharma, Veena Prabhakaran

Publication date: 21 October 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.08.018

zbMATH Keywords

chordal graphscactus graphseternal vertex coversubstructure property

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Some algorithmic results for eternal vertex cover problem in graphs ⋮ Eternal vertex cover on bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Independent protection in graphs
• Vertex covers and eternal dominating sets
• Parameterized algorithm for eternal vertex cover
• The eternal dominating set problem for interval graphs
• Graphs with equal eternal vertex cover and eternal domination numbers
• Tight bounds for eternal dominating sets in graphs
• Eternal Independent Sets in Graphs

This page was built for publication: A substructure based lower bound for eternal vertex cover number