Colouring graphs with constraints on connectivity

Pierre Aboulker, Nick Brettell, Frédéric Havet +2

A graph $G$ has maximal local edge-connectivity $k$ if the maximum number of edge-disjoint paths between every pair of distinct vertices $x$ and $y$ is at most $k$. We prove Brooks…