Pages that link to "Item:Q5925521"
From MaRDI portal
The following pages link to Matching cut in graphs with large minimum degree (Q5925521):
Displaying 12 items.
- Matching cutsets in graphs of diameter 2 (Q955037) (← links)
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization (Q2032346) (← links)
- 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)
- Matching of \(5-\gamma \)-critical leafless graph with a cut edge (Q2423119) (← links)
- Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization (Q5875553) (← links)
- The perfect matching cut problem revisited (Q5918785) (← links)
- The perfect matching cut problem revisited (Q5925551) (← links)
- Parameterized complexity of perfectly matched sets (Q6038698) (← 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)