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