Oriented trees in O(k k)-chromatic digraphs, a subquadratic bound for Burr's conjecture

DOI10.1007/978-3-031-75409-8_6MaRDI QIDQ6988727zbMATH OpenFDO

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

Publication date 2 May 2025

Full work available at URL https://doi.org/10.1007/978-3-031-75409-8_6

zbMATH Keywords

directed graphsgraph colouring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A proof of Sumner's universal tournament conjecture for large tournaments
• Digraphs
• Existence of paths with t blocks in k ( t )-chromatic digraph
• Graph Theory and Probability
• scientific article; zbMATH DE number 3708430 (Why is no real title available?)
• scientific article; zbMATH DE number 3747156 (Why is no real title available?)
• scientific article; zbMATH DE number 3480625 (Why is no real title available?)
• scientific article; zbMATH DE number 3257176 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• Nombre chromatique et plus longs chemins d'un graphe
• On three blocks paths \(P (k, l, r)\)
• Oriented trees in digraphs
• Paths with two blocks in k-chromatic digraphs
• Paths with two blocks in \(n\)-chromatic digraphs
• Trees contained in every orientation of a graph
• Trees in tournaments
• Trees in tournaments
• Zur algebraischen Begründung der Graphentheorie. I

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 Q6988727)