Pages that link to "Item:Q2840733"
From MaRDI portal
The following pages link to On the maximum uniquely restricted matching for bipartite graphs (Q2840733):
Displaying 12 items.
- Zero forcing number, constrained matchings and strong structural controllability (Q491112) (← links)
- The uniquely solvable bipartite matching problem (Q1178733) (← links)
- Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings (Q1414591) (← links)
- On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs (Q2283036) (← links)
- On some hard and some tractable cases of the maximum acyclic matching problem (Q2288858) (← links)
- Approximating maximum uniquely restricted matchings in bipartite graphs (Q2322866) (← links)
- Uniquely restricted matchings in subcubic graphs (Q2416436) (← links)
- Uniquely Restricted Matchings in Interval Graphs (Q3130447) (← links)
- Graphs in which some and every maximum matching is uniquely restricted (Q4553727) (← links)
- Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids (Q5067424) (← links)
- On the complexity of minimum maximal uniquely restricted matching (Q5918362) (← links)
- On the complexity of minimum maximal acyclic matchings (Q6621851) (← links)