Pierre Aboulker

From MaRDI portal
Person:312154

Available identifiers

zbMath Open aboulker.pierreMaRDI QIDQ312154

List of research outcomes





PublicationDate of PublicationType
\((\overrightarrow{P_6}\), triangle)-free digraphs have bounded dichromatic number2025-01-27Paper
On the dichromatic number of surfaces2024-09-13Paper
On the minimum number of arcs in \(k\)-dicritical oriented graphs2024-06-25Paper
Heroes in oriented complete multipartite graphs2024-02-23Paper
Various bounds on the minimum number of arcs in a \(k\)-dicritical digraph2024-02-19Paper
Four proofs of the directed Brooks' theorem2023-11-27Paper
Graphs with no induced house nor induced hole have the de Bruijn–Erdös property2023-10-05Paper
Grundy Coloring and friends, half-graphs, bicliques2023-04-21Paper
Digraph Colouring and Arc-Connectivity2023-04-10Paper
https://portal.mardi4nfdi.de/entity/Q58743352023-02-07Paper
(P6, triangle)-free digraphs have bounded dichromatic number2022-12-05Paper
Vizing's and Shannon's theorems for defective edge colouring2022-11-08Paper
Decomposing and colouring some locally semicomplete digraphs2022-09-14Paper
On the minimum number of arcs in $k$-dicritical oriented graphs2022-07-03Paper
Chordal directed graphs are not \(\chi\)-bounded2022-05-12Paper
On the dichromatic number of surfaces2022-04-04Paper
On the tree-width of even-hole-free graphs2021-09-02Paper
Extension of Gyárfás-Sumner conjecture to digraphs2021-06-07Paper
Decomposing and colouring some locally semicomplete digraphs2021-03-14Paper
Extension complexity of the correlation polytope2020-02-10Paper
Grundy Coloring & friends, Half-Graphs, Bicliques2020-01-11Paper
Distributed coloring in sparse graphs with fewer colors2019-11-15Paper
Distributed Coloring in Sparse Graphs with Fewer Colors2019-09-19Paper
Subdivisions in digraphs of large out-degree or large dichromatic number2019-08-05Paper
χ‐bounded families of oriented graphs2019-01-03Paper
A Tight Erdös--Pósa Function for Wheel Minors2018-09-14Paper
A New Class of Graphs That Satisfies the Chen‐Chvátal Conjecture2018-02-23Paper
Coloring Graphs with Constraints on Connectivity2017-08-10Paper
De Bruijn-Erdős-type theorems for graphs and posets2017-02-27Paper
Excluding clocks2016-10-17Paper
Lines, betweenness and metric spaces2016-09-14Paper
Wheel-free planar graphs2015-06-18Paper
Vertex elimination orderings for hereditary graph classes2015-01-30Paper
Excluding cycles with a fixed number of chords2014-11-28Paper
The Chen-Chvátal conjecture for metric spaces induced by distance-hereditary graphs2014-10-08Paper
Excluding 4‐Wheels2014-05-22Paper
Number of lines in hypergraphs2014-05-06Paper
Linear balanceable and subcubic balanceable graphs2014-01-28Paper
On wheel-free graphs2013-09-09Paper
Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It2013-04-09Paper
Finding forest-orderings of tournaments is NP-completeN/APaper
Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given orderN/APaper

Research outcomes over time

This page was built for person: Pierre Aboulker