Pages that link to "Item:Q5918091"
From MaRDI portal
The following pages link to Dominating induced matching in some subclasses of bipartite graphs (Q5918091):
Displaying 8 items.
- Induced matchings in bipartite graphs (Q921017) (← links)
- Maximum weight induced matching in some subclasses of bipartite graphs (Q2023124) (← links)
- Some results on dominating induced matchings (Q2117540) (← links)
- Exact algorithms for dominating induced matching based on graph partition (Q2352792) (← links)
- A polynomial-time algorithm for the dominating induced matching problem in the class of convex graphs (Q2839221) (← links)
- Induced Matching in Some Subclasses of Bipartite Graphs (Q2971661) (← links)
- On convexity in split graphs: complexity of Steiner tree and domination (Q6123388) (← links)
- Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time (Q6201338) (← links)