Guillaume Aubian

Orcid: 0000-0001-9726-4990

According to our database1, Guillaume Aubian authored at least 17 papers between 2022 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
(Claw, C_3)-free digraphs with unbounded dichromatic number.
CoRR, February, 2026

On cuts of small chromatic number in sparse graphs.
Discret. Math., 2026

Complexity Gaps Between Point and Interval Temporal Graphs for Some Reachability Problems.
Proceedings of the 5th Symposium on Algorithmic Foundations of Dynamic Networks, 2026

2025
Extension of the Gyárfás-Sumner conjecture to signed graphs.
CoRR, November, 2025

On the Complexity of Computing a Fastest Temporal Path in Interval Temporal Graphs.
CoRR, January, 2025

Problems, Proofs, and Disproofs on the Inversion Number.
Electron. J. Comb., 2025

2024
Heroes in oriented complete multipartite graphs.
J. Graph Theory, April, 2024

Computing the clique number of tournaments.
CoRR, 2024

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

2023
Four proofs of the directed Brooks' Theorem.
Discret. Math., November, 2023

Clique number of tournaments.
CoRR, 2023

Digraph Colouring and Arc-Connectivity.
CoRR, 2023

2022
Heroes in Orientations of Chordal Graphs.
SIAM J. Discret. Math., 2022

Decomposing and colouring some locally semicomplete digraphs.
Eur. J. Comb., 2022

Problems, proofs, and disproofs on the inversion number.
CoRR, 2022

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

Vizing's and Shannon's Theorems for Defective Edge Colouring.
Electron. J. Comb., 2022


  Loading...