On the complexity of the dominating induced matching problem in hereditary classes of graphs (Q716179)
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 the dominating induced matching problem in hereditary classes of graphs |
scientific article; zbMATH DE number 5880189
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the dominating induced matching problem in hereditary classes of graphs |
scientific article; zbMATH DE number 5880189 |
Statements
On the complexity of the dominating induced matching problem in hereditary classes of graphs (English)
0 references
19 April 2011
0 references
dominating induced matching
0 references
efficient edge dominating set
0 references
polynomial-time algorithm
0 references
0 references
0 references
