On the complexity of the dominating induced matching problem in hereditary classes of graphs (Q716179): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:00, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the dominating induced matching problem in hereditary classes of graphs |
scientific article |
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
