The following pages link to A Min-Max Theorem on Tournaments (Q3507526):
Displaying 17 items.
- Finding good 2-partitions of digraphs. I. Hereditary properties (Q290530) (← links)
- Coloring digraphs with forbidden cycles (Q490994) (← links)
- Minimal stable sets in tournaments (Q634517) (← links)
- Are there any good digraph width measures? (Q896003) (← links)
- Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree (Q960967) (← links)
- A combinatorial property of the maximum round robin tournament problem (Q969517) (← links)
- The \((-1)\)-critical tournaments (Q1014129) (← links)
- Ranking tournaments with no errors. II: Minimax relation (Q1985451) (← links)
- Extension of Gyárfás-Sumner conjecture to digraphs (Q2030749) (← links)
- On ideal semicomplete digraphs (Q2296276) (← links)
- Coloring tournaments: from local to global (Q2312616) (← links)
- The removal lemma for tournaments (Q2421551) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- (Q4432153) (← links)
- (Q4472696) (← links)
- Digraph coloring and distance to acyclicity (Q6614618) (← links)
- Coloring tournaments with few colors: algorithms and complexity (Q6654122) (← links)