Factorially Many Maximum Matchings Close to the Erdős-Gallai Bound. - Stéphane Bessy; Johannes Pardey; Lucas Picasarri-Arrieta; Dieter Rautenbach (Electron. J. Comb., 2022)

Complexity of some arc-partition problems for digraphs. - Jørgen Bang-Jensen; Stéphane Bessy; Daniel Gonçalves 001; Lucas Picasarri-Arrieta (Theor. Comput. Sci., 2022)

Unbalanced Spanning Subgraphs in Edge Labeled Complete Graphs. - Stéphane Bessy; Johannes Pardey; Lucas Picasarri-Arrieta; Dieter Rautenbach (Electron. J. Comb., 2023)

Minimum number of arcs in k-critical digraphs with order at most 2k-1. - Lucas Picasarri-Arrieta; Michael Stiebitz (CoRR, 2023)

Complexity Results on the Decomposition of a Digraph into Directed Linear Forests and Out-Stars. - Florian Hörsch; Lucas Picasarri-Arrieta (Electron. J. Comb., 2024)

Brooks-type colourings of digraphs in linear time. - Daniel Gonçalves 001; Lucas Picasarri-Arrieta; Amadeus Reinald (CoRR, 2024)

Redicolouring digraphs: Directed treewidth and cycle-degeneracy. - Nicolas Nisse; Lucas Picasarri-Arrieta; Ignasi Sau (Discret. Appl. Math., 2024)

Minimum number of arcs in k-critical digraphs with order at most 2k - 1. - Lucas Picasarri-Arrieta; Michael Stiebitz (Discret. Math., 2024)

Subdivisions in dicritical digraphs with large order or digirth. - Lucas Picasarri-Arrieta; Clément Rambaud (Eur. J. Comb., 2024)

On the minimum number of arcs in 4-dicritical oriented graphs. - Frédéric Havet; Lucas Picasarri-Arrieta; Clément Rambaud (J. Graph Theory, 2024)

Strengthening the directed Brooks' theorem for oriented graphs and consequences on digraph redicolouring. - Lucas Picasarri-Arrieta (J. Graph Theory, 2024)

Constrained flows in networks. - Jørgen Bang-Jensen; Stéphane Bessy; Lucas Picasarri-Arrieta (Theor. Comput. Sci., 2024)

Digraph redicolouring. - Nicolas Bousquet 001; Frédéric Havet; Nicolas Nisse; Lucas Picasarri-Arrieta; Amadeus Reinald (Eur. J. Comb., 2024)

An analogue of Reed's conjecture for digraphs. - Ken-ichi Kawarabayashi; Lucas Picasarri-Arrieta (SODA, 2025)

The 3-Dicritical Semi-Complete Digraphs. - Frédéric Havet; Florian Hörsch; Lucas Picasarri-Arrieta (Electron. J. Comb., 2025)

(Δ-1)-dicolouring of digraphs. - Ararat Harutyunyan; Ken-ichi Kawarabayashi; Lucas Picasarri-Arrieta; Gil Puig i Surroca (CoRR, 2025)

Dichromatic number of chordal graphs. - Stéphane Bessy; Frédéric Havet; Lucas Picasarri-Arrieta (Graphs Comb., 2025)