Coloring Graphs with Constraints on Connectivity
(2016)
Journal Article
Aboulker, P., Brettell, N., Havet, F., Marx, D., & Trotignon, N. (2016). Coloring Graphs with Constraints on Connectivity. Journal of Graph Theory, 85(4), 814-838. https://doi.org/10.1002/jgt.22109
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‐type theorems for k‐connected graphs with maximal local edge‐connectivity k, an... Read More about Coloring Graphs with Constraints on Connectivity.