Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time (Q524382): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:26, 30 January 2024
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
