Dominating induced matchings in \(S_{1 , 2 , 4}\)-free graphs (Q2174557)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7191150
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dominating induced matchings in \(S_{1 , 2 , 4}\)-free graphs |
scientific article; zbMATH DE number 7191150 |
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
0.939953088760376
0 references
0.9328811764717102
0 references
0.8833422064781189
0 references
0.8819547295570374
0 references
0.8812950253486633
0 references
