Cosecure domination: hardness results and algorithms (Q6182909)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Cosecure domination: hardness results and algorithms |
scientific article; zbMATH DE number 7781740
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cosecure domination: hardness results and algorithms |
scientific article; zbMATH DE number 7781740 |
Statements
Cosecure domination: hardness results and algorithms (English)
0 references
22 December 2023
0 references
cosecure domination
0 references
bipartite graphs
0 references
doubly chordal graphs
0 references
bounded tree-width graphs
0 references
NP-completeness
0 references
0 references
