Amadeus Reinald

activity

20212026

most citedProving a directed analogue of the Gyárfás-Sumner conjecture for orientations of

P_{4}

1 citations · 1 across the 10 of their papers we have counts for

collaborators

Showing 2024 · math.COShow all

2 papers · 2 filters

math.CO2024

Brooks-type colourings of digraphs in linear time

Daniel Gonçalves, Lucas Picasarri-Arrieta, Amadeus Reinald

Brooks' Theorem is a fundamental result on graph colouring, stating that the chromatic number of a graph is almost always upper bounded by its maximal degree. Lovász showed that su…

math.CO2024

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

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

In 1980, Burr conjectured that every directed graph with chromatic number $2 k - 2$ contains any oriented tree of order $k$ as a subdigraph. Burr showed that chromatic number $(k-1)^2…

Brooks-type colourings of digraphs in linear time

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

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