Pages that link to "Item:Q1683558"
From MaRDI portal
The following pages link to On the complexity of minimum cardinality maximal uniquely restricted matching in graphs (Q1683558):
Displaying 5 items.
- On the hardness of deciding the equality of the induced and the uniquely restricted matching number (Q2414056) (← links)
- On the maximum uniquely restricted matching for bipartite graphs (Q2840733) (← links)
- On the complexity of minimum maximal uniquely restricted matching (Q5918362) (← links)
- On the complexity of minimum maximal acyclic matchings (Q6621851) (← links)
- Minimum maximal acyclic matching in proper interval graphs (Q6648282) (← links)