Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four

Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno +1

We address the induced matching enumeration problem. An edge set $M$ is an induced matching of a graph $G=(V,E)$. The enumeration of matchings are widely studied in literature, bu…