Pages that link to "Item:Q2158196"
From MaRDI portal
The following pages link to Finding dominating induced matchings in \(P_9\)-free graphs in polynomial time (Q2158196):
Displaying 8 items.
- Dominating induced matchings for \(P_7\)-free graphs in linear time (Q476446) (← links)
- Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time (Q524382) (← links)
- Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time (Q777392) (← links)
- Finding dominating induced matchings in \(S_{2, 2, 3}\)-free graphs in polynomial time (Q2192098) (← links)
- A polynomial-time algorithm for the dominating induced matching problem in the class of convex graphs (Q2839221) (← links)
- Computational complexity aspects of super domination (Q6076353) (← links)
- Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time (Q6201338) (← links)
- Graphs whose vertices of degree at least 2 lie in a triangle (Q6667338) (← links)