Pages that link to "Item:Q716179"
From MaRDI portal
The following pages link to On the complexity of the dominating induced matching problem in hereditary classes of graphs (Q716179):
Displayed 5 items.
- Dominating induced matchings for \(P_7\)-free graphs in linear time (Q476446) (← links)
- Fast algorithms for some dominating induced matching problems (Q2015144) (← links)
- Exact algorithms for dominating induced matching based on graph partition (Q2352792) (← links)
- Dominating induced matchings in graphs without a skew star (Q2447537) (← links)
- The Maximum Number of Dominating Induced Matchings (Q4982287) (← links)