1 paper · 1 filter
A. V. Jayanthan, S. A. Seyed Fakhari, I. Swanson +1
Let G be a finite simple graph and let indm(G) and ordm(G) denote the induced matching number and the ordered matching number of G, respectively. We characterize all bipartite grap…