Complexity results on cosecure domination in graphs
From MaRDI portal
Publication:6132550
Cites Work
- scientific article; zbMATH DE number 3882470 (Why is no real title available?)
- scientific article; zbMATH DE number 2188604 (Why is no real title available?)
- A Linear Recognition Algorithm for Cographs
- A simple linear time algorithm for cograph recognition
- Algorithmic complexity of secure connected domination in graphs
- An optimal path cover algorithm for cographs
- Analytical approach to parallel repetition
- Approximation hardness of dominating set problems in bounded degree graphs
- Co-secure and secure domination in graphs
- Co-secure domination in Mycielski graphs
- Dominating sets for split and bipartite graphs
- Homogeneous sets and domination: A linear time algorithm for distance-hereditary graphs
- On computing secure domination of trees
- On secure domination in graphs
- Secure domination and secure total domination in graphs
- Secure domination in cographs
- Some APX-completeness results for cubic graphs
- Structures of domination in graphs
- The co-secure domination in proper interval graphs
- The complexity of secure domination problem in graphs
- The design of approximation algorithms
- Topics in Domination in Graphs
Cited In (4)
This page was built for publication: Complexity results on cosecure domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132550)