Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time (Q524382): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-016-0150-y / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-016-0150-Y / rank | |||
Normal rank | |||
Latest revision as of 20:22, 9 December 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
0 references
