34 citations · 63 across the 21 of their papers we have counts for
1 paper · 1 filter
Ilkyoo Choi, Jaehoon Kim, Suil O
Given a graph G, the matching number of G, written α′(G), is the maximum size of a matching in G, and the fractional matching number of G, written αf′(G), is the maxim…