Dominating induced matchings in \(S_{1 , 2 , 4}\)-free graphs (Q2174557)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dominating induced matchings in \(S_{1 , 2 , 4}\)-free graphs |
scientific article |
Statements
Dominating induced matchings in \(S_{1 , 2 , 4}\)-free graphs (English)
0 references
21 April 2020
0 references
dominating induced matching
0 references
efficient edge domination
0 references
\( S_{1, 2, 4}\)-free graphs
0 references
polynomial time algorithm
0 references
0 references
