Finding dominating induced matchings in \(S_{2, 2, 3}\)-free graphs in polynomial time (Q2192098)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding dominating induced matchings in \(S_{2, 2, 3}\)-free graphs in polynomial time |
scientific article |
Statements
Finding dominating induced matchings in \(S_{2, 2, 3}\)-free graphs in polynomial time (English)
0 references
29 June 2020
0 references
dominating induced matching
0 references
efficient edge domination
0 references
\( S_{2, 2, 3}\)-free graphs
0 references
polynomial time algorithm
0 references
0 references
