The following pages link to Pierre Aboulker (Q312154):
Displayed 37 items.
- Lines, betweenness and metric spaces (Q312159) (← links)
- Excluding clocks (Q324738) (← links)
- The Chen-Chvátal conjecture for metric spaces induced by distance-hereditary graphs (Q458577) (← links)
- Excluding cycles with a fixed number of chords (Q476296) (← links)
- De Bruijn-Erdős-type theorems for graphs and posets (Q512579) (← links)
- On the tree-width of even-hole-free graphs (Q1979431) (← links)
- Extension of Gyárfás-Sumner conjecture to digraphs (Q2030749) (← links)
- Vizing's and Shannon's theorems for defective edge colouring (Q2094863) (← links)
- On the dichromatic number of surfaces (Q2121762) (← links)
- Chordal directed graphs are not \(\chi\)-bounded (Q2138574) (← links)
- Extension complexity of the correlation polytope (Q2294265) (← links)
- Subdivisions in digraphs of large out-degree or large dichromatic number (Q2315440) (← links)
- Distributed coloring in sparse graphs with fewer colors (Q2335690) (← links)
- Wheel-free planar graphs (Q2349958) (← links)
- Number of lines in hypergraphs (Q2449115) (← links)
- Vertex elimination orderings for hereditary graph classes (Q2514166) (← links)
- Decomposing and colouring some locally semicomplete digraphs (Q2674564) (← links)
- Grundy Coloring and friends, half-graphs, bicliques (Q2700380) (← links)
- Linear Balanceable and Subcubic Balanceable Graphs* (Q2874096) (← links)
- A New Class of Graphs That Satisfies the Chen‐Chvátal Conjecture (Q4604017) (← links)
- χ‐bounded families of oriented graphs (Q4646938) (← links)
- Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It (Q4915184) (← links)
- Coloring Graphs with Constraints on Connectivity (Q4978449) (← links)
- Distributed Coloring in Sparse Graphs with Fewer Colors (Q5197707) (← links)
- A Tight Erdös--Pósa Function for Wheel Minors (Q5374439) (← links)
- Excluding 4‐Wheels (Q5417825) (← links)
- (Q5874335) (← links)
- Graphs with no induced house nor induced hole have the de Bruijn–Erdös property (Q6081879) (← links)
- Four proofs of the directed Brooks' theorem (Q6091815) (← links)
- Various bounds on the minimum number of arcs in a \(k\)-dicritical digraph (Q6117430) (← links)
- Heroes in oriented complete multipartite graphs (Q6199386) (← links)
- On wheel-free graphs (Q6244651) (← links)
- Grundy Coloring & friends, Half-Graphs, Bicliques (Q6332689) (← links)
- Decomposing and colouring some locally semicomplete digraphs (Q6362799) (← links)
- On the minimum number of arcs in $k$-dicritical oriented graphs (Q6403855) (← links)
- (P6, triangle)-free digraphs have bounded dichromatic number (Q6419572) (← links)
- Digraph Colouring and Arc-Connectivity (Q6432653) (← links)