Bessy, S., Gonçalves, D., & Reinald, A. (2024). Oriented trees in $O(k \sqrt{k})$-chromatic digraphs, a subquadratic bound for Burr's conjecture.
Chicago Style (17th ed.) CitationBessy, Stéphane, Daniel Gonçalves, and Amadeus Reinald. Oriented Trees in $O(k \sqrt{k})$-chromatic Digraphs, a Subquadratic Bound for Burr's Conjecture. 2024.
MLA (9th ed.) CitationBessy, Stéphane, et al. Oriented Trees in $O(k \sqrt{k})$-chromatic Digraphs, a Subquadratic Bound for Burr's Conjecture. 2024.
Warning: These citations may not always be 100% accurate.