Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time (Q6201338)
From MaRDI portal
scientific article; zbMATH DE number 7807472
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time |
scientific article; zbMATH DE number 7807472 |
Statements
Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time (English)
0 references
20 February 2024
0 references
dominating induced matching
0 references
efficient edge domination
0 references
\( P_{10}\)-free graphs
0 references
polynomial time algorithm
0 references
0 references
