Oriented trees in $O(k \sqrt{k})$-chromatic digraphs, a subquadratic bound for Burr's conjecture

arXiv2402.19351MaRDI QIDQ6524060

Daniel Gonçalves, Amadeus Reinald, Stéphane Bessy

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

This page was built for publication: Oriented trees in $O(k \sqrt{k})$-chromatic digraphs, a subquadratic bound for Burr's conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6524060)