Pages that link to "Item:Q2322866"
From MaRDI portal
The following pages link to Approximating maximum uniquely restricted matchings in bipartite graphs (Q2322866):
Displaying 13 items.
- The uniquely solvable bipartite matching problem (Q1178733) (← links)
- Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings (Q1414591) (← links)
- On the complexity of minimum cardinality maximal uniquely restricted matching in graphs (Q1683558) (← links)
- Lower bounds on the uniquely restricted matching number (Q1733882) (← links)
- Matchings under distance constraints. I (Q2241576) (← links)
- Uniquely restricted matchings in subcubic graphs (Q2416436) (← links)
- Unicycle bipartite graphs with only uniquely restricted maximum matchings (Q2752151) (← links)
- On the maximum uniquely restricted matching for bipartite graphs (Q2840733) (← links)
- Near Linear Time Approximation Schemes for Uncapacitated and Capacitated b–Matching Problems in Nonbipartite Graphs (Q5383977) (← links)
- On the complexity of minimum maximal uniquely restricted matching (Q5918362) (← links)
- Uniquely restricted matchings (Q5946402) (← links)
- Uniquely restricted matchings in subcubic graphs without short cycles (Q6055410) (← links)
- Matchings under distance constraints. II. (Q6596960) (← links)