Finding dominating induced matchings in \(P_9\)-free graphs in polynomial time (Q2158196)
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₉-free graphs in polynomial time |
scientific article; zbMATH DE number 7562661
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding dominating induced matchings in \(P_9\)-free graphs in polynomial time |
scientific article; zbMATH DE number 7562661 |
Statements
Finding dominating induced matchings in \(P_9\)-free graphs in polynomial time (English)
0 references
26 July 2022
0 references
dominating induced matching
0 references
\(P_9\)-free graphs
0 references
polynomial time algorithm
0 references
0 references
0.9278831481933594
0 references
0.9278166890144348
0 references
0.9233927726745604
0 references
0.8955389857292175
0 references
0.8921414017677307
0 references
