Lucas Picasarri-Arrieta

Publication Activity (10 Years)

Years Active: 2022-2024
Publications (10 Years): 20

Top Topics

Top Venues

Electron. J. Comb.

Theor. Comput. Sci.

Publications

Daniel Gonçalves, Lucas Picasarri-Arrieta, Amadeus Reinald
Brooks-type colourings of digraphs in linear time. CoRR (2024)
Ken-ichi Kawarabayashi, Lucas Picasarri-Arrieta
An analogue of Reed's conjecture for digraphs. CoRR (2024)
Lucas Picasarri-Arrieta, Clément Rambaud
Subdivisions in dicritical digraphs with large order or digirth. Eur. J. Comb. 122 (2024)
Lucas Picasarri-Arrieta, Michael Stiebitz
Minimum number of arcs in k-critical digraphs with order at most 2k - 1. Discret. Math. 347 (9) (2024)
Florian Hörsch, Lucas Picasarri-Arrieta
Complexity results on the decomposition of a digraph into directed linear forests and out-stars. CoRR (2024)
Lucas Picasarri-Arrieta, Clément Rambaud
Subdivisions in dicritical digraphs with large order or digirth. CoRR (2024)
Nicolas Nisse, Lucas Picasarri-Arrieta, Ignasi Sau
Redicolouring digraphs: Directed treewidth and cycle-degeneracy. Discret. Appl. Math. 356 (2024)
Jørgen Bang-Jensen, Stéphane Bessy, Lucas Picasarri-Arrieta
Constrained flows in networks. Theor. Comput. Sci. 1010 (2024)
Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald
Digraph redicolouring. Eur. J. Comb. 116 (2024)
Stéphane Bessy, Johannes Pardey, Lucas Picasarri-Arrieta, Dieter Rautenbach
Unbalanced Spanning Subgraphs in Edge Labeled Complete Graphs. Electron. J. Comb. 30 (1) (2023)
Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud
On the Minimum Number of Arcs in 4-Dicritical Oriented Graphs. WG (2023)
Nicolas Nisse, Lucas Picasarri-Arrieta, Ignasi Sau
Redicolouring digraphs: directed treewidth and cycle-degeneracy. CoRR (2023)
Lucas Picasarri-Arrieta
Strengthening the Directed Brooks' Theorem for oriented graphs and consequences on digraph redicolouring. CoRR (2023)
Stéphane Bessy, Jørgen Bang-Jensen, Lucas Picasarri-Arrieta
Constrained Flows in Networks. CoRR (2023)
Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald
Digraph redicolouring. CoRR (2023)
Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud
On the minimum number of arcs in 4-dicritical oriented graphs. CoRR (2023)
Stéphane Bessy, Frédéric Havet, Lucas Picasarri-Arrieta
Dichromatic number of chordal graphs. CoRR (2023)
Lucas Picasarri-Arrieta, Michael Stiebitz
Minimum number of arcs in k-critical digraphs with order at most 2k-1. CoRR (2023)
Jørgen Bang-Jensen, Stéphane Bessy, Daniel Gonçalves, Lucas Picasarri-Arrieta
Complexity of some arc-partition problems for digraphs. Theor. Comput. Sci. 928 (2022)
Stéphane Bessy, Johannes Pardey, Lucas Picasarri-Arrieta, Dieter Rautenbach
Factorially Many Maximum Matchings Close to the Erdős-Gallai Bound. Electron. J. Comb. 29 (2) (2022)