The following pages link to Tournaments and colouring (Q1932469):
Displaying 33 items.
- Extending the Gyárfás-Sumner conjecture (Q401488) (← links)
- Excluding pairs of graphs (Q402589) (← links)
- Biased orientation games (Q418878) (← links)
- Tournaments with near-linear transitive subsets (Q462934) (← links)
- Coloring digraphs with forbidden cycles (Q490994) (← links)
- The edge density of critical digraphs (Q519953) (← links)
- A tournament approach to pattern avoiding matrices (Q522321) (← links)
- Unavoidable tournaments (Q895998) (← links)
- Domination in tournaments (Q1745734) (← links)
- The diachromatic number of digraphs (Q1784278) (← links)
- Coloring tournaments: from local to global (Q2312616) (← links)
- Forcing large transitive subtournaments (Q2343283) (← links)
- EH-suprema of tournaments with no nontrivial homogeneous sets (Q2349509) (← links)
- Topology of acyclic complexes of tournaments and coloring (Q2352522) (← links)
- The removal lemma for tournaments (Q2421551) (← links)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
- The Erdös-Hajnal Conjecture-A Survey (Q2874098) (← links)
- Structure Theorem for<i>U</i><sub>5</sub>-free Tournaments (Q2940986) (← links)
- DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER (Q2971041) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Heroes in Orientations of Chordal Graphs (Q5043055) (← links)
- Large Unavoidable Subtournaments (Q5366934) (← links)
- Strong complete minors in digraphs (Q5886331) (← links)
- Coloring dense digraphs (Q5915818) (← links)
- Complete directed minors and chromatic number (Q6046643) (← links)
- On coloring digraphs with forbidden induced subgraphs (Q6074583) (← links)
- Pure pairs. X. Tournaments and the strong Erdős-Hajnal property (Q6081115) (← links)
- Acyclic coloring of products of digraphs (Q6130210) (← links)
- Heroes in oriented complete multipartite graphs (Q6199386) (← links)
- Chromatic number is not tournament-local (Q6564606) (← links)
- Coloring tournaments with few colors: algorithms and complexity (Q6654122) (← links)
- On heroes in digraphs with forbidden induced forests (Q6664146) (← links)
- \((\overrightarrow{P_6}\), triangle)-free digraphs have bounded dichromatic number (Q6671592) (← links)
