LexBFS, structure and algorithms - Pierre Aboulker; Pierre Charbit; Maria Chudnovsky; Nicolas Trotignon; Kristina Vuskovic (CoRR, 2012)

Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It. - Pierre Aboulker; Marko Radovanovic; Nicolas Trotignon; Kristina Vuskovic (SIAM J. Discret. Math., 2012)

Number of lines in hypergraphs. - Pierre Aboulker; J. Adrian Bondy; Xiaomin Chen; Ehsan Chiniforooshan; Vasek Chvátal; Peihan Miao 001 (Discret. Appl. Math., 2014)

Excluding 4-Wheels. - Pierre Aboulker (J. Graph Theory, 2014)

Linear Balanceable and Subcubic Balanceable Graphs. - Pierre Aboulker; Marko Radovanovic; Nicolas Trotignon; Théophile Trunck; Kristina Vuskovic (J. Graph Theory, 2014)

Colouring graphs with constraints on connectivity. - Pierre Aboulker; Nick Brettell; Frédéric Havet; Dániel Marx; Nicolas Trotignon (CoRR, 2015)

Excluding cycles with a fixed number of chords. - Pierre Aboulker; Nicolas Bousquet 001 (Discret. Appl. Math., 2015)

Vertex elimination orderings for hereditary graph classes. - Pierre Aboulker; Pierre Charbit; Nicolas Trotignon; Kristina Vuskovic (Discret. Math., 2015)

Wheel-free planar graphs. - Pierre Aboulker; Maria Chudnovsky; Paul D. Seymour; Nicolas Trotignon (Eur. J. Comb., 2015)

The Chen-Chvátal conjecture for metric spaces induced by distance-hereditary graphs. - Pierre Aboulker; Rohan Kapadia (Eur. J. Comb., 2015)

Excluding clocks. - Pierre Aboulker; Zhentao Li; Stéphan Thomassé (Electron. Notes Discret. Math., 2015)

Lines, Betweenness and Metric Spaces. - Pierre Aboulker; Xiaomin Chen; Guangda Huzhang; Rohan Kapadia; Cathryn Supko (Discret. Comput. Geom., 2016)

De Bruijn-Erdős-type theorems for graphs and posets. - Pierre Aboulker; Guillaume Lagarde; David Malec; Abhishek Methuku; Casey Tompkins (Discret. Math., 2017)

Coloring Graphs with Constraints on Connectivity. - Pierre Aboulker; Nick Brettell; Frédéric Havet; Dániel Marx; Nicolas Trotignon (J. Graph Theory, 2017)

χ-bounded families of oriented graphs. - Pierre Aboulker; Jørgen Bang-Jensen; Nicolas Bousquet 001; Pierre Charbit; Frédéric Havet; Frédéric Maffray; José Zamora (J. Graph Theory, 2018)

A New Class of Graphs That Satisfies the Chen-Chvátal Conjecture. - Pierre Aboulker; Martín Matamala; Paul Rochet; José Zamora (J. Graph Theory, 2018)

A Tight Erdös-Pósa Function for Wheel Minors. - Pierre Aboulker; Samuel Fiorini; Tony Huynh; Gwenaël Joret; Jean-Florent Raymond; Ignasi Sau (SIAM J. Discret. Math., 2018)

Distributed Coloring in Sparse Graphs with Fewer Colors. - Pierre Aboulker; Marthe Bonamy; Nicolas Bousquet 001; Louis Esperet (Electron. J. Comb., 2019)

Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number. - Pierre Aboulker; Nathann Cohen; Frédéric Havet; William Lochet; Phablo F. S. Moura; Stéphan Thomassé (Electron. J. Comb., 2019)

Extension complexity of the correlation polytope. - Pierre Aboulker; Samuel Fiorini; Tony Huynh; Marco Macchia; Johanna Seif (Oper. Res. Lett., 2019)

Grundy Coloring & Friends, Half-Graphs, Bicliques. - Pierre Aboulker; Édouard Bonnet; Eun Jung Kim 002; Florian Sikora (STACS, 2020)

Extension of Gyárfás-Sumner Conjecture to Digraphs. - Pierre Aboulker; Pierre Charbit; Reza Naserasr (Electron. J. Comb., 2021)

On the tree-width of even-hole-free graphs. - Pierre Aboulker; Isolde Adler; Eun Jung Kim 002; Ni Luh Dewi Sintiari; Nicolas Trotignon (Eur. J. Comb., 2021)

Vizing's and Shannon's Theorems for Defective Edge Colouring. - Pierre Aboulker; Guillaume Aubian; Chien-Chung Huang 001 (Electron. J. Comb., 2022)

Chordal Directed Graphs Are Not $ chi$-Bounded. - Pierre Aboulker; Nicolas Bousquet 001; Rémi de Joannis de Verclos (Electron. J. Comb., 2022)

On the Dichromatic Number of Surfaces. - Pierre Aboulker; Frédéric Havet; Kolja Knauer; Clément Rambaud (Electron. J. Comb., 2022)

On the minimum number of arcs in k-dicritical oriented graphs. - Pierre Aboulker; Thomas Bellitto; Frédéric Havet; Clément Rambaud (CoRR, 2022)

(P6, triangle)-free digraphs have bounded dichromatic number. - Pierre Aboulker; Guillaume Aubian; Pierre Charbit; Stéphan Thomassé (CoRR, 2022)

Decomposing and colouring some locally semicomplete digraphs. - Pierre Aboulker; Guillaume Aubian; Pierre Charbit (Eur. J. Comb., 2022)

Graphs with no induced house nor induced hole have the de Bruijn-Erdös property. - Pierre Aboulker; Laurent Beaudou; Martín Matamala; José Zamora (J. Graph Theory, 2022)

Heroes in Orientations of Chordal Graphs. - Pierre Aboulker; Guillaume Aubian; Raphael Steiner (SIAM J. Discret. Math., 2022)

Grundy Coloring and Friends, Half-Graphs, Bicliques. - Pierre Aboulker; Édouard Bonnet; Eun Jung Kim 002; Florian Sikora (Algorithmica, 2023)

Digraph Colouring and Arc-Connectivity. - Pierre Aboulker; Guillaume Aubian; Pierre Charbit (CoRR, 2023)

Clique number of tournaments. - Pierre Aboulker; Guillaume Aubian; Pierre Charbit; Raul Lopes 001 (CoRR, 2023)

Four proofs of the directed Brooks' Theorem. - Pierre Aboulker; Guillaume Aubian (Discret. Math., 2023)

($ overrightarrow{P_6}$, triangle)-Free Digraphs Have Bounded Dichromatic Number. - Pierre Aboulker; Guillaume Aubian; Pierre Charbit; Stéphan Thomassé (Electron. J. Comb., 2024)

Various Bounds on the Minimum Number of Arcs in a $k$-Dicritical Digraph. - Pierre Aboulker; Quentin Vermande (Electron. J. Comb., 2024)

Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order. - Pierre Aboulker; Frédéric Havet; François Pirot; Juliette Schabanel (CoRR, 2024)

On the Minimum Number of Arcs in ( boldsymbol{k} )-Dicritical Oriented Graphs. - Pierre Aboulker; Thomas Bellitto; Frédéric Havet; Clément Rambaud (SIAM J. Discret. Math., 2024)

Heroes in oriented complete multipartite graphs. - Pierre Aboulker; Guillaume Aubian; Pierre Charbit (J. Graph Theory, 2024)

Induced Disjoint Paths Without an Induced Minor. - Pierre Aboulker; Édouard Bonnet; Timothé Picavet; Nicolas Trotignon (ICALP, 2025)