The following pages link to Coloring dense digraphs (Q5919339):
Displaying 12 items.
- Tournaments and colouring (Q1932469) (← links)
- Extension of Gyárfás-Sumner conjecture to digraphs (Q2030749) (← links)
- Set colorings of digraphs (Q2831597) (← links)
- Heroes in Orientations of Chordal Graphs (Q5043055) (← links)
- Strong complete minors in digraphs (Q5886331) (← links)
- Coloring dense digraphs (Q5915818) (← links)
- Complete directed minors and chromatic number (Q6046643) (← links)
- Four proofs of the directed Brooks' theorem (Q6091815) (← links)
- Heroes in oriented complete multipartite graphs (Q6199386) (← 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)