1 paper
Ayana Hirano, Kazunori Matsuda
Let G be a finite simple graph on the vertex set V(G)={x1,…,xn} and match(G), min-match(G) and ind-match(G) the matching number, minimum matching number…