The following pages link to Disjoint paths in tournaments (Q481696):
Displaying 16 items.
- Tournament pathwidth and topological containment (Q744161) (← links)
- Edge-disjoint in- and out-branchings in tournaments and related path problems (Q1112061) (← links)
- Disjoint paths in unions of tournaments (Q1719586) (← links)
- Polynomial time algorithms for tracking path problems (Q2144269) (← links)
- Paths with many shortcuts in tournaments (Q2219961) (← links)
- Parity of paths in tournaments (Q2297716) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- DAG-width and circumference of digraphs (Q2811203) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Lexicographic Orientation Algorithms (Q3120444) (← links)
- On the Pathwidth of Almost Semicomplete Digraphs (Q3452843) (← links)
- Polynomial Time Algorithms for Tracking Path Problems (Q5041188) (← links)
- Disjoint Paths in Decomposable Digraphs (Q5272934) (← links)
- Path decompositions of tournaments (Q6075058) (← links)