Stéphane Bessy, Daniel Gonçalves, Amadeus Reinald. Oriented trees in O(kk)-chromatic digraphs, a subquadratic bound for Burr's conjecture. // Journal of Combinatorial Theory, Series B. – 2027. – DOI: 10.1016/j.jctb.2026.09.007. – URL: https://doi.org/10.1016/j.jctb.2026.09.007
Stéphane Bessy, Daniel Gonçalves, & Amadeus Reinald (2027). Oriented trees in O(kk)-chromatic digraphs, a subquadratic bound for Burr's conjecture. Journal of Combinatorial Theory, Series B. https://doi.org/10.1016/j.jctb.2026.09.007
Stéphane Bessy, et al. “Oriented trees in O(kk)-chromatic digraphs, a subquadratic bound for Burr's conjecture.” Journal of Combinatorial Theory, Series B, 2027. doi:10.1016/j.jctb.2026.09.007.
@article{Bessy2027,
title = {Oriented trees in O(kk)-chromatic digraphs, a subquadratic bound for Burr's conjecture},
author = {Bessy, Stéphane and Gonçalves, Daniel and Reinald, Amadeus},
journal = {Journal of Combinatorial Theory, Series B},
year = {2027},
doi = {10.1016/j.jctb.2026.09.007},
url = {https://doi.org/10.1016/j.jctb.2026.09.007}
}