On the complexity of domination number determination in monogenic classes of graphs (Q4284972)
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: On the complexity of domination number determination in monogenic classes of graphs |
scientific article; zbMATH DE number 525966
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of domination number determination in monogenic classes of graphs |
scientific article; zbMATH DE number 525966 |
Statements
On the complexity of domination number determination in monogenic classes of graphs (English)
0 references
19 April 1994
0 references
dominating set
0 references
NP-complete
0 references
forbidden subgraph
0 references
