Lucas Picasarri-Arrieta

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

Collaborative distances:

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

2026

Increasing arc-connectivity by bounded- and fixed-size inversions.

Florian Hörsch, Lucas Picasarri-Arrieta

CoRR, April, 2026

On cuts of small chromatic number in sparse graphs.

Guillaume Aubian, Marthe Bonamy, Romain Bourneuf, Oscar Fontaine, Lucas Picasarri-Arrieta

Discret. Math., 2026

2025

Acyclic dichromatic number of oriented graphs.

Jørgen Bang-Jensen, Lucas Picasarri-Arrieta, Anders Yeo

CoRR, November, 2025

Generalized DP-colorings of digraphs.

Lucas Picasarri-Arrieta, Michael Stiebitz

CoRR, September, 2025

The Complexity of Finding and Counting Subtournaments.

Simon Döring, Sarah Houdaigoui, Lucas Picasarri-Arrieta, Philip Wellnitz

CoRR, September, 2025

Dichromatic number of chordal graphs.

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

Graphs Comb., August, 2025

(Δ-1)-dicolouring of digraphs.

Ararat Harutyunyan, Ken-ichi Kawarabayashi, Lucas Picasarri-Arrieta, Gil Puig i Surroca

CoRR, July, 2025

Brooks-Type Colourings of Digraphs in Linear Time.

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

J. Graph Theory, 2025

The 3-Dicritical Semi-Complete Digraphs.

Frédéric Havet, Florian Hörsch, Lucas Picasarri-Arrieta

Electron. J. Comb., 2025

An analogue of Reed's conjecture for digraphs.

Ken-ichi Kawarabayashi, Lucas Picasarri-Arrieta

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Backbone colouring of chordal graphs.

Júlio Araújo, Nicolas Nisse, Lucas Picasarri-Arrieta

Proceedings of the XIII Latin-American Algorithms, Graphs and Optimization Symposium, 2025

2024

Digraph redicolouring.

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

Eur. J. Comb., February, 2024

Constrained flows in networks.

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

Theor. Comput. Sci., 2024

Strengthening the directed Brooks' theorem for oriented graphs and consequences on digraph redicolouring.

Lucas Picasarri-Arrieta

J. Graph Theory, 2024

Subdivisions in dicritical digraphs with large order or digirth.

Lucas Picasarri-Arrieta, Clément Rambaud

Eur. J. Comb., 2024

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

Lucas Picasarri-Arrieta, Michael Stiebitz

Discret. Math., 2024

Redicolouring digraphs: Directed treewidth and cycle-degeneracy.

Nicolas Nisse, Lucas Picasarri-Arrieta, Ignasi Sau

Discret. Appl. Math., 2024

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

2023

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

Lucas Picasarri-Arrieta, Michael Stiebitz

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