The following pages link to Tournament immersion and cutwidth (Q765193):
Displaying 13 items.
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- Edge-disjoint paths in digraphs with bounded independence number (Q473097) (← links)
- A well-quasi-order for tournaments (Q618033) (← links)
- Tournament pathwidth and topological containment (Q744161) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Constructing graphs with no immersion of large complete graphs (Q2922213) (← links)
- Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number (Q5090975) (← links)
- Characterizations and directed path-width of sequence digraphs (Q6038712) (← links)
- On the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments (Q6045407) (← links)
- Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number (Q6107892) (← links)
