1 paper
Lingjuan Shi, Wei Li, Kai Deng
An independent edge set of graph G is a matching, and is maximal if it is not a proper subset of any other matching of G. The number of all the maximal matchings of G is deno…