Some new algorithmic results on co-secure domination in graphs
From MaRDI portal
(Redirected from Publication:6190005)
Cites work
- Co-secure and secure domination in graphs
- Co-secure domination in Mycielski graphs
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
- Complexity results on cosecure domination in graphs
- Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee
- Dominating sets for split and bipartite graphs
- Doubly chordal graphs, steiner trees, and connected domination
- Feedback vertex sets on restricted bipartite graphs
- Graph structure and monadic second-order logic. A language-theoretic approach
- Graph theory
- scientific article; zbMATH DE number 2188604 (Why is no real title available?)
- Independent domination on tree convex bipartite graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- Linear-time certifying recognition algorithms and forbidden induced subgraphs
- On secure domination in graphs
- On the clique-width of some perfect graph classes
- Reducibility among combinatorial problems
- Secure domination and secure total domination in graphs
- Secure domination in cographs
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- The co-secure domination in proper interval graphs
- The complexity of secure domination problem in graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- Topics in Domination in Graphs
- Two Hardness Results on Feedback Vertex Sets
- Upper bounds to the clique width of graphs
Cited in
(2)
This page was built for publication: Some new algorithmic results on co-secure domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6190005)
