Pages that link to "Item:Q6046951"
From MaRDI portal
The following pages link to Finding matching cuts in \(H\)-free graphs (Q6046951):
Displaying 5 items.
- Matching cutsets in graphs of diameter 2 (Q955037) (← links)
- Finding a central vertex in an HHD-free graph (Q1408816) (← links)
- A note on matching-cut in \(P_t\)-free graphs (Q2094374) (← links)
- Matching cut in graphs with large minimum degree (Q5925521) (← links)
- Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius (Q6614030) (← links)