Guillaume Aubian

According to our database, Guillaume Aubian authored at least 12 papers between 2022 and 2025.

Collaborative distances:

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

2025

On the Complexity of Computing a Fastest Temporal Path in Interval Temporal Graphs.

Guillaume Aubian, Filippo Brunelli, Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Allen Ibiapina, Laurent Viennot

CoRR, January, 2025

2024

Heroes in oriented complete multipartite graphs.

Pierre Aboulker, Guillaume Aubian, Pierre Charbit

J. Graph Theory, April, 2024

Computing the clique number of tournaments.

Guillaume Aubian

CoRR, 2024

($\overrightarrow{P_6}$, triangle)-Free Digraphs Have Bounded Dichromatic Number.

Pierre Aboulker, Guillaume Aubian, Pierre Charbit, Stéphan Thomassé

Electron. J. Comb., 2024

2023

Four proofs of the directed Brooks' Theorem.

Pierre Aboulker, Guillaume Aubian

Discret. Math., November, 2023

Clique number of tournaments.

Pierre Aboulker, Guillaume Aubian, Pierre Charbit, Raul Lopes

CoRR, 2023

Digraph Colouring and Arc-Connectivity.

Pierre Aboulker, Guillaume Aubian, Pierre Charbit

CoRR, 2023

2022

Heroes in Orientations of Chordal Graphs.

Pierre Aboulker, Guillaume Aubian, Raphael Steiner

SIAM J. Discret. Math., 2022

Decomposing and colouring some locally semicomplete digraphs.

Pierre Aboulker, Guillaume Aubian, Pierre Charbit

Eur. J. Comb., 2022

Problems, proofs, and disproofs on the inversion number.

Guillaume Aubian, Frédéric Havet, Florian Hörsch, Felix Klingelhöfer, Nicolas Nisse, Clément Rambaud, Quentin Vermande

CoRR, 2022

(P6, triangle)-free digraphs have bounded dichromatic number.

Pierre Aboulker, Guillaume Aubian, Pierre Charbit, Stéphan Thomassé

CoRR, 2022

Vizing's and Shannon's Theorems for Defective Edge Colouring.

Pierre Aboulker, Guillaume Aubian, Chien-Chung Huang

Electron. J. Comb., 2022