Pages that link to "Item:Q2087455"
From MaRDI portal
The following pages link to On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs (Q2087455):
Displaying 5 items.
- A note on matching-cut in \(P_t\)-free graphs (Q2094374) (← links)
- Finding matching cuts in \(H\)-free graphs (Q6046951) (← links)
- On The Complexity of Matching Cut for Graphs of Bounded Radius and $H$-Free Graphs (Q6396539) (← links)
- Cutting Barnette graphs perfectly is hard (Q6589850) (← links)
- Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius (Q6614030) (← links)