Eternal connected vertex cover problem in graphs: complexity and algorithms
From MaRDI portal
bipartite graphscographsdistance-hereditary graphseternal connected vertex covergraph algorithmsHamiltonian graphsMycielskian
Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites work
- A new lower bound for the eternal vertex cover number of graphs
- A substructure based lower bound for eternal vertex cover number
- Completely separable graphs
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
- Edge protection in graphs
- Eternal connected vertex cover problem
- Eternal connected vertex cover problem in graphs: complexity and algorithms
- Eternal vertex cover on bipartite graphs
- Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- Maximum independent sets in 3- and 4-regular Hamiltonian graphs
- On graphs whose eternal vertex cover number and vertex cover number coincide
- On Representatives of Subsets
- On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
- Parameterized algorithm for eternal vertex cover
- Some algorithmic results for eternal vertex cover problem in graphs
- The connected vertex cover problem in \(k\)-regular graphs
- The Rectilinear Steiner Tree Problem is NP-Complete
- Vertex and edge covers with clustering properties: Complexity and algorithms
This page was built for publication: Eternal connected vertex cover problem in graphs: complexity and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6908088)
