Pages that link to "Item:Q1740696"
From MaRDI portal
The following pages link to A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter (Q1740696):
Displaying 12 items.
- On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs (Q2087455) (← links)
- A note on matching-cut in \(P_t\)-free graphs (Q2094374) (← links)
- An FPT algorithm for matching cut and d-cut (Q2115892) (← links)
- Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms (Q2192064) (← links)
- Perfectly matched sets in graphs: parameterized and exact computation (Q2697539) (← links)
- The perfect matching cut problem revisited (Q5918785) (← links)
- Matching cut in graphs with large minimum degree (Q5925521) (← 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)
- The complexity of the perfect matching-cut problem (Q6667583) (← links)
