Pages that link to "Item:Q2115892"
From MaRDI portal
The following pages link to An FPT algorithm for matching cut and d-cut (Q2115892):
Displaying 6 items.
- On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs (Q2087455) (← links)
- (Q5009482) (← links)
- The perfect matching cut problem revisited (Q5918785) (← links)
- The perfect matching cut problem revisited (Q5925551) (← links)
- Finding matching cuts in \(H\)-free graphs (Q6046951) (← links)
- Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius (Q6614030) (← links)