Pierre Aboulker

Orcid: 0000-0003-2532-1516

According to our database1, Pierre Aboulker authored at least 40 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

On the Minimum Number of Arcs in \(\boldsymbol{k}\)-Dicritical Oriented Graphs.
SIAM J. Discret. Math., 2024

Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order.
CoRR, 2024

Various Bounds on the Minimum Number of Arcs in a $k$-Dicritical Digraph.
Electron. J. Comb., 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

Grundy Coloring and Friends, Half-Graphs, Bicliques.
Algorithmica, 2023

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

Graphs with no induced house nor induced hole have the de Bruijn-Erdös property.
J. Graph Theory, 2022

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

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

On the minimum number of arcs in k-dicritical oriented graphs.
CoRR, 2022

On the Dichromatic Number of Surfaces.
Electron. J. Comb., 2022

Chordal Directed Graphs Are Not $\chi$-Bounded.
Electron. J. Comb., 2022

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

2021
On the tree-width of even-hole-free graphs.
Eur. J. Comb., 2021

Extension of Gyárfás-Sumner Conjecture to Digraphs.
Electron. J. Comb., 2021

2020
Grundy Coloring & Friends, Half-Graphs, Bicliques.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

2019
Extension complexity of the correlation polytope.
Oper. Res. Lett., 2019

Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number.
Electron. J. Comb., 2019

Distributed Coloring in Sparse Graphs with Fewer Colors.
Electron. J. Comb., 2019

2018
A Tight Erdös-Pósa Function for Wheel Minors.
SIAM J. Discret. Math., 2018

A New Class of Graphs That Satisfies the Chen-Chvátal Conjecture.
J. Graph Theory, 2018

χ-bounded families of oriented graphs.
J. Graph Theory, 2018

2017
Coloring Graphs with Constraints on Connectivity.
J. Graph Theory, 2017

De Bruijn-Erdős-type theorems for graphs and posets.
Discret. Math., 2017

2016
Lines, Betweenness and Metric Spaces.
Discret. Comput. Geom., 2016

2015
Excluding clocks.
Electron. Notes Discret. Math., 2015

The Chen-Chvátal conjecture for metric spaces induced by distance-hereditary graphs.
Eur. J. Comb., 2015

Wheel-free planar graphs.
Eur. J. Comb., 2015

Vertex elimination orderings for hereditary graph classes.
Discret. Math., 2015

Excluding cycles with a fixed number of chords.
Discret. Appl. Math., 2015

Colouring graphs with constraints on connectivity.
CoRR, 2015

2014
Linear Balanceable and Subcubic Balanceable Graphs.
J. Graph Theory, 2014

Excluding 4-Wheels.
J. Graph Theory, 2014

Number of lines in hypergraphs.
Discret. Appl. Math., 2014

2012
Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It.
SIAM J. Discret. Math., 2012

LexBFS, structure and algorithms
CoRR, 2012


  Loading...