Complexity results on cosecure domination in graphs (Q6132550)
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: Complexity results on cosecure domination in graphs |
scientific article; zbMATH DE number 7728674
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity results on cosecure domination in graphs |
scientific article; zbMATH DE number 7728674 |
Statements
Complexity results on cosecure domination in graphs (English)
0 references
17 August 2023
0 references
cosecure domination
0 references
perfect graphs
0 references
cographs
0 references
NP-complete
0 references
APX-hard
0 references
0 references
