Pages that link to "Item:Q2237892"
From MaRDI portal
The following pages link to Refined notions of parameterized enumeration kernels with applications to matching cut enumeration (Q2237892):
Displaying 5 items.
- 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)
- Cutting Barnette graphs perfectly is hard (Q6589850) (← links)
- Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius (Q6614030) (← links)