The following pages link to (Q5747399):
Displayed 11 items.
- Detecting induced minors in AT-free graphs (Q390909) (← links)
- Disconnected cuts in claw-free graphs (Q2186821) (← links)
- Detecting fixed patterns in chordal graphs in polynomial time (Q2249737) (← links)
- Path Contraction Faster than $2^n$ (Q3300757) (← links)
- (Q5009627) (← links)
- Path Contraction Faster Than 2^n (Q5091159) (← links)
- Induced Disjoint Paths in Claw-Free Graphs (Q5251566) (← links)
- Contracting bipartite graphs to paths and cycles (Q5915810) (← links)
- Contracting bipartite graphs to paths and cycles (Q5920049) (← links)
- The complexity of contracting bipartite graphs into small cycles (Q6039435) (← links)
- Contracting to a longest path in H-free graphs (Q6065420) (← links)