Eternal vertex cover on bipartite graphs

DOI10.1007/978-3-031-09574-0_5MaRDI QIDQ2097214zbMATH OpenOpenAlexFDO

Authors Jasine Babu, Neeldhara Misra, Saraswati Girish Nanoti

Publication date 11 November 2022

Full work available at URL https://doi.org/10.1007/978-3-031-09574-0_5

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• On graphs whose eternal vertex cover number and vertex cover number coincide
• Vertex covers and eternal dominating sets
• On graphs with minimal eternal vertex cover number
• An eternal vertex cover problem
• Some algorithmic results for eternal vertex cover problem in graphs
• Graphs with equal eternal vertex cover and eternal domination numbers
• A new lower bound for the eternal vertex cover number of graphs
• A new lower bound for the eternal vertex cover number of graphs
• Eternal connected vertex cover problem
• Parameterized algorithm for eternal vertex cover

Cites work

• A new lower bound for the eternal vertex cover number of graphs
• A substructure based lower bound for eternal vertex cover number
• Automata, logics, and infinite games. A guide to current research
• Edge protection in graphs
• Eternal connected vertex cover problem
• Fundamentals of parameterized complexity
• Graph theory
• Graphs with equal eternal vertex cover and eternal domination numbers
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• Kernelization lower bounds through colors and IDs
• Kernelization. Theory of parameterized preprocessing
• On graphs with minimal eternal vertex cover number
• Parameterized algorithm for eternal vertex cover
• Parameterized algorithms
• Parametrized complexity theory.

Cited in

(10)

• A substructure based lower bound for eternal vertex cover number
• Some algorithmic results for eternal vertex cover problem in graphs
• Eternal connected vertex cover problem in graphs: complexity and algorithms
• 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
• Computing eternal vertex cover number of maximal outerplanar graphs in linear time
• Eternal connected vertex cover problem in graphs: complexity and algorithms
• Two step graph protection game
• Parameterized algorithm for eternal vertex cover

This page was built for publication: Eternal vertex cover on bipartite graphs

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