Pages that link to "Item:Q2192098"
From MaRDI portal
The following pages link to Finding dominating induced matchings in \(S_{2, 2, 3}\)-free graphs in polynomial time (Q2192098):
Displaying 11 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)
- On the complexity of the dominating induced matching problem in hereditary classes of graphs (Q716179) (← links)
- Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time (Q777392) (← links)
- Finding dominating induced matchings in \(P_9\)-free graphs in polynomial time (Q2158196) (← links)
- Dominating induced matchings in \(S_{1 , 2 , 4}\)-free graphs (Q2174557) (← links)
- Independent domination in finitely defined classes of graphs: polynomial algorithms (Q2255037) (← links)
- Dominating induced matchings in graphs without a skew star (Q2447537) (← links)
- Dominating induced matching in some subclasses of bipartite graphs (Q5918091) (← 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)
