On graphs with minimal eternal vertex cover number

DOI10.1007/978-3-030-11509-8_22MaRDI QIDQ2326577zbMATH OpenOpenAlexFDO

Authors Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier

Publication date 10 October 2019

Full work available at URL https://arxiv.org/abs/1812.05125

zbMATH Keywords

chordal graphsconnected vertex covereternal vertex cover

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• On graphs whose eternal vertex cover number and vertex cover number coincide
• A substructure based lower bound for eternal vertex cover number
• Parameterized algorithm for eternal vertex cover
• Graphs with equal eternal vertex cover and eternal domination numbers
• An eternal vertex cover problem

Cited in

(13)

• Eternal vertex cover on bipartite graphs
• On graphs whose eternal vertex cover number and vertex cover number coincide
• A substructure based lower bound for eternal vertex cover number
• Minimal vertex covers in infinite hypergraphs
• Mortal and eternal vertex covers
• Edge protection in graphs
• Secure vertex cover of a graph
• A new lower bound for the eternal vertex cover number of graphs
• Some algorithmic results for eternal vertex cover problem in graphs
• Representation of the eternal vertex cover problem as a dynamic Stackelberg game
• Some algorithmic results for eternal vertex cover problem in graphs
• Stability of vertex covers in a game with finitely many steps
• Two step graph protection game

This page was built for publication: On graphs with minimal eternal vertex cover number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2326577)