The authors claim a polynomial-time algorithm for Dominating Induced Matching on P9-free graphs, generalizing earlier results, but a central observation in the proof is flawed.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Finding Dominating Induced Matchings in $P_9$-Free Graphs in Polynomial Time
The authors claim a polynomial-time algorithm for Dominating Induced Matching on P9-free graphs, generalizing earlier results, but a central observation in the proof is flawed.