The following pages link to Good edge-labelling of graphs (Q5916095):
Displayed 6 items.
- A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter (Q1740696) (← links)
- On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs (Q2087455) (← links)
- Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms (Q2192064) (← links)
- (Q5009482) (← links)
- Matching cut in graphs with large minimum degree (Q5925521) (← links)
- Finding matching cuts in \(H\)-free graphs (Q6046951) (← links)