The following pages link to Tournament minors (Q2343292):
Displayed 18 items.
- Forbidden directed minors and Kelly-width (Q501668) (← links)
- Are there any good digraph width measures? (Q896003) (← links)
- A unified treatment of linked and lean tree-decompositions (Q1745735) (← links)
- \(k\)-distinct in- and out-branchings in digraphs (Q1747490) (← links)
- A Menger-like property of tree-cut width (Q1998754) (← links)
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs (Q2032354) (← links)
- Directed width parameters on semicomplete digraphs (Q2150583) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- On well quasi-order of graph classes under homomorphic image orderings (Q2357228) (← 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)
- Lean Tree-Cut Decompositions: Obstructions and Algorithms (Q5090482) (← links)
- (Q5092387) (← links)
- Directed Path-Decompositions (Q5215903) (← links)
- Strong complete minors in digraphs (Q5886331) (← links)
- Complete directed minors and chromatic number (Q6046643) (← links)
- Cut-sufficient directed 2-commodity multiflow topologies (Q6086019) (← links)