The following pages link to A Min-Max Theorem on Tournaments (Q3507526):
Displaying 7 items.
- Finding good 2-partitions of digraphs. I. Hereditary properties (Q290530) (← links)
- Coloring digraphs with forbidden cycles (Q490994) (← links)
- Are there any good digraph width measures? (Q896003) (← 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)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
