Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time (Q777392)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time |
scientific article |
Statements
Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time (English)
0 references
7 July 2020
0 references
\(S_{1, 1, 5}\)-free graphs
0 references
polynomial time algorithm
0 references
