Pages that link to "Item:Q4553727"
From MaRDI portal
The following pages link to Graphs in which some and every maximum matching is uniquely restricted (Q4553727):
Displaying 15 items.
- Graphs with restricted valency and matching number (Q1043593) (← links)
- Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings (Q1414591) (← links)
- Lower bounds on the uniquely restricted matching number (Q1733882) (← links)
- Generalized subgraph-restricted matchings in graphs (Q1779490) (← links)
- Perfect matching cuts partitioning a graph into complementary subgraphs (Q2169960) (← 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)
- On the hardness of deciding the equality of the induced and the uniquely restricted matching number (Q2414056) (← links)
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids (Q2462380) (← links)
- On unicyclic graphs with uniquely restricted maximum matchings (Q2637732) (← links)
- Unicycle bipartite graphs with only uniquely restricted maximum matchings (Q2752151) (← links)
- Unicycle graphs and uniquely restricted maximum matchings (Q3439344) (← links)
- (Q4901196) (← links)
- Uniquely restricted matchings (Q5946402) (← links)