Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time (Q524382)
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 \(P_8\)-free graphs in polynomial time |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time |
scientific article |
Statements
Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time (English)
0 references
2 May 2017
0 references
dominating induced matching
0 references
efficient edge domination
0 references
\(P_8\)-free graphs
0 references
polynomial time algorithm
0 references
0 references
