Lucas Picasarri-Arrieta

According to our database, Lucas Picasarri-Arrieta authored at least 12 papers between 2022 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Digraph redicolouring.

Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald

Eur. J. Comb., February, 2024

Complexity results on the decomposition of a digraph into directed linear forests and out-stars.

Florian Hörsch, Lucas Picasarri-Arrieta

CoRR, 2024

Subdivisions in dicritical digraphs with large order or digirth.

Lucas Picasarri-Arrieta, Clément Rambaud

CoRR, 2024

2023

Minimum number of arcs in k-critical digraphs with order at most 2k-1.

Lucas Picasarri-Arrieta, Michael Stiebitz

CoRR, 2023

Constrained Flows in Networks.

Stéphane Bessy, Jørgen Bang-Jensen, Lucas Picasarri-Arrieta

CoRR, 2023

Dichromatic number of chordal graphs.

Stéphane Bessy, Frédéric Havet, Lucas Picasarri-Arrieta

CoRR, 2023

Redicolouring digraphs: directed treewidth and cycle-degeneracy.

Nicolas Nisse, Lucas Picasarri-Arrieta, Ignasi Sau

CoRR, 2023

Strengthening the Directed Brooks' Theorem for oriented graphs and consequences on digraph redicolouring.

Lucas Picasarri-Arrieta

CoRR, 2023

Unbalanced Spanning Subgraphs in Edge Labeled Complete Graphs.

Stéphane Bessy, Johannes Pardey, Lucas Picasarri-Arrieta, Dieter Rautenbach

Electron. J. Comb., 2023

On the Minimum Number of Arcs in 4-Dicritical Oriented Graphs.

Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

2022

Complexity of some arc-partition problems for digraphs.

Jørgen Bang-Jensen, Stéphane Bessy, Daniel Gonçalves, Lucas Picasarri-Arrieta

Theor. Comput. Sci., 2022

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