24 citations · 100 across the 34 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015★ 13 cited
Colouring graphs with constraints on connectivity
Pierre Aboulker, Nick Brettell, Frédéric Havet +2
A graph has maximal local edge-connectivity if the maximum number of edge-disjoint paths between every pair of distinct vertices and is at most . We prove Brooks…
math.CO2015
De Bruijn-Erdős type theorems for graphs and posets
Pierre Aboulker, Guillaume Lagarde, David Malec +2
A classical theorem of De Bruijn and Erdős asserts that any noncollinear set of n points in the plane determines at least n distinct lines. We prove that an analogue of this theore…