A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k

Sam Bastida, Nick Brettell

For a graph $G$ with at least two vertices, the maximum local edge-connectivity of $G$ is the maximum number of edge-disjoint $(u,v)$-paths over all distinct pairs of vertices $(u,…