Lucas Picasarri-Arrieta

34 papers A* 1B 1C 1Journal 31
YearRankTypeTitle / Venue / Authors
2026 J jnl
On cuts of small chromatic number in sparse graphs.
Discret. Math.
Guillaume Aubian, Marthe Bonamy, Romain Bourneuf, Oscar Fontaine, Lucas Picasarri-Arrieta
2025 J jnl
(Δ-1)-dicolouring of digraphs.
CoRR
Ararat Harutyunyan, Ken-ichi Kawarabayashi, Lucas Picasarri-Arrieta, Gil Puig i Surroca
2025 J jnl
Acyclic dichromatic number of oriented graphs.
CoRR
Jørgen Bang-Jensen, Lucas Picasarri-Arrieta, Anders Yeo
2025 A* conf
An analogue of Reed's conjecture for digraphs.
SODA
Ken-ichi Kawarabayashi, Lucas Picasarri-Arrieta
2025 C conf
Backbone colouring of chordal graphs.
LAGOS
Júlio Araújo, Nicolas Nisse, Lucas Picasarri-Arrieta
2025 J jnl
Brooks-Type Colourings of Digraphs in Linear Time.
J. Graph Theory
Daniel Gonçalves, Lucas Picasarri-Arrieta, Amadeus Reinald
2025 J jnl
Dichromatic number of chordal graphs.
Graphs Comb.
Stéphane Bessy, Frédéric Havet, Lucas Picasarri-Arrieta
2025 J jnl
Generalized DP-colorings of digraphs.
CoRR
Lucas Picasarri-Arrieta, Michael Stiebitz
2025 J jnl
On cuts of small chromatic number in sparse graphs.
CoRR
Guillaume Aubian, Marthe Bonamy, Romain Bourneuf, Oscar Fontaine, Lucas Picasarri-Arrieta
2025 J jnl
The 3-Dicritical Semi-Complete Digraphs.
Electron. J. Comb.
Frédéric Havet, Florian Hörsch, Lucas Picasarri-Arrieta
2025 J jnl
The Complexity of Finding and Counting Subtournaments.
CoRR
Simon Döring, Sarah Houdaigoui, Lucas Picasarri-Arrieta, Philip Wellnitz
2024 J jnl
An analogue of Reed's conjecture for digraphs.
CoRR
Ken-ichi Kawarabayashi, Lucas Picasarri-Arrieta
2024 J jnl
Brooks-type colourings of digraphs in linear time.
CoRR
Daniel Gonçalves, Lucas Picasarri-Arrieta, Amadeus Reinald
2024 J jnl
Complexity Results on the Decomposition of a Digraph into Directed Linear Forests and Out-Stars.
Electron. J. Comb.
Florian Hörsch, Lucas Picasarri-Arrieta
2024 J jnl
Complexity results on the decomposition of a digraph into directed linear forests and out-stars.
CoRR
Florian Hörsch, Lucas Picasarri-Arrieta
2024 J jnl
Constrained flows in networks.
Theor. Comput. Sci.
Jørgen Bang-Jensen, Stéphane Bessy, Lucas Picasarri-Arrieta
2024 J jnl
Digraph redicolouring.
Eur. J. Comb.
Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald
2024 J jnl
Minimum number of arcs in k-critical digraphs with order at most 2k - 1.
Discret. Math.
Lucas Picasarri-Arrieta, Michael Stiebitz
2024 J jnl
On the minimum number of arcs in 4-dicritical oriented graphs.
J. Graph Theory
Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud
2024 J jnl
Redicolouring digraphs: Directed treewidth and cycle-degeneracy.
Discret. Appl. Math.
Nicolas Nisse, Lucas Picasarri-Arrieta, Ignasi Sau
2024 J jnl
Strengthening the directed Brooks' theorem for oriented graphs and consequences on digraph redicolouring.
J. Graph Theory
Lucas Picasarri-Arrieta
2024 J jnl
Subdivisions in dicritical digraphs with large order or digirth.
CoRR
Lucas Picasarri-Arrieta, Clément Rambaud
2024 J jnl
Subdivisions in dicritical digraphs with large order or digirth.
Eur. J. Comb.
Lucas Picasarri-Arrieta, Clément Rambaud
2023 J jnl
Constrained Flows in Networks.
CoRR
Stéphane Bessy, Jørgen Bang-Jensen, Lucas Picasarri-Arrieta
2023 J jnl
Dichromatic number of chordal graphs.
CoRR
Stéphane Bessy, Frédéric Havet, Lucas Picasarri-Arrieta
2023 J jnl
Digraph redicolouring.
CoRR
Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald
2023 J jnl
Minimum number of arcs in k-critical digraphs with order at most 2k-1.
CoRR
Lucas Picasarri-Arrieta, Michael Stiebitz
2023 B conf
On the Minimum Number of Arcs in 4-Dicritical Oriented Graphs.
WG
Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud
2023 J jnl
On the minimum number of arcs in 4-dicritical oriented graphs.
CoRR
Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud
2023 J jnl
Redicolouring digraphs: directed treewidth and cycle-degeneracy.
CoRR
Nicolas Nisse, Lucas Picasarri-Arrieta, Ignasi Sau
2023 J jnl
Strengthening the Directed Brooks' Theorem for oriented graphs and consequences on digraph redicolouring.
CoRR
Lucas Picasarri-Arrieta
2023 J jnl
Unbalanced Spanning Subgraphs in Edge Labeled Complete Graphs.
Electron. J. Comb.
Stéphane Bessy, Johannes Pardey, Lucas Picasarri-Arrieta, Dieter Rautenbach
2022 J jnl
Complexity of some arc-partition problems for digraphs.
Theor. Comput. Sci.
Jørgen Bang-Jensen, Stéphane Bessy, Daniel Gonçalves, Lucas Picasarri-Arrieta
2022 J jnl
Factorially Many Maximum Matchings Close to the Erdős-Gallai Bound.
Electron. J. Comb.
Stéphane Bessy, Johannes Pardey, Lucas Picasarri-Arrieta, Dieter Rautenbach