Edge protection in graphs
From MaRDI portal
Recommendations
Cited in
(28)- Eternal vertex cover on bipartite graphs
- On graphs whose eternal vertex cover number and vertex cover number coincide
- Dominating vertex covers: the vertex-edge domination problem
- A substructure based lower bound for eternal vertex cover number
- Graphs with equal eternal vertex cover and eternal domination numbers
- How to Guard a Graph?
- Independent protection in graphs
- Vertex covers and eternal dominating sets
- \(m\)-secure vertex cover of a graph
- scientific article; zbMATH DE number 6157485 (Why is no real title available?)
- A dynamic domination problem in trees
- Eternal Independent Sets in Graphs
- An eternal vertex cover problem
- Secure vertex cover of a graph
- scientific article; zbMATH DE number 2188604 (Why is no real title available?)
- A new lower bound for the eternal vertex cover number of graphs
- Some algorithmic results for eternal vertex cover problem in graphs
- Eternal connected vertex cover problem in graphs: complexity and algorithms
- Eternal feedback vertex sets: a new graph protection model using guards
- 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
- m-eternal domination and variants on some classes of finite and infinite graphs
- 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
- (Eternal) vertex cover numbers of infinite and finite grid graphs
- Parameterized algorithm for eternal vertex cover
This page was built for publication: Edge protection in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3059008)
