The following pages link to A well-quasi-order for tournaments (Q618033):
Displayed 19 items.
- Rao's degree sequence conjecture (Q401494) (← links)
- Forbidden directed minors and Kelly-width (Q501668) (← links)
- Tournament immersion and cutwidth (Q765193) (← links)
- Cutwidth: obstructions and algorithmic aspects (Q1725643) (← links)
- A unified treatment of linked and lean tree-decompositions (Q1745735) (← links)
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs (Q2032354) (← links)
- Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation (Q2099416) (← links)
- Directed width parameters on semicomplete digraphs (Q2150583) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- Tournament minors (Q2343292) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- Well-quasi-ordering hereditarily finite sets (Q2855754) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Recent Progress on Well-Quasi-ordering Graphs (Q3295151) (← links)
- On the Pathwidth of Almost Semicomplete Digraphs (Q3452843) (← links)
- Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number (Q5090975) (← links)
- (Q5092387) (← links)
- Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number (Q6107892) (← links)
- Monoidal Width: Capturing Rank Width (Q6150162) (← links)