An eternal vertex cover problem
From MaRDI portal
Publication:5298902
zbMATH Open1274.05382MaRDI QIDQ5298902FDOQ5298902
Authors: William F. Klostermeyer 
Publication date: 25 June 2013
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (16)
- A substructure based lower bound for eternal vertex cover number
- On graphs with minimal eternal vertex cover number
- Independent protection in graphs
- Eternal feedback vertex sets: a new graph protection model using guards
- Mortal and eternal vertex covers
- Maximum-demand graphs for eternal security
- Graphs with equal eternal vertex cover and eternal domination numbers
- Edge protection in graphs
- Vertex covers and eternal dominating sets
- Parameterized algorithm for eternal vertex cover
- Some algorithmic results for eternal vertex cover problem in graphs
- Stability of vertex covers in a game with finitely many steps
- \(m\)-secure vertex cover of a graph
- Secure vertex cover of a graph
- Eternal Independent Sets in Graphs
- Eternal vertex cover on bipartite graphs
This page was built for publication: An eternal vertex cover problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5298902)
