A new width parameter of graphs based on edge cuts: $\hat{I}\pm$-edge-crossing width

Abstract

We introduce graph width parameters, called $\hat{I}\pm$-edge-crossing width and edge-crossing width. These are defined in terms of the number of edges crossing a bag of a tree-cut decomposition. They are motivated by edge-cut width, recently introduced by Brand et al. (WG 2022). We show that edge-crossing width is equivalent to the known parameter tree-partition-width. On the other hand, $\hat{I}\pm$-edge-crossing width is a new parameter; tree-cut width and $\hat{I}\pm$-edge-crossing width are incomparable, and they both lie between tree-partition-width and edge-cut width. We provide an algorithm that, for a given $n$-vertex graph $G$ and integers $k$ and $\hat{I}\pm$, in time $2^{O((\hat{I}\pm +k)\log (\hat{I}\pm +k))}{n}^2$ either outputs a tree-cut decomposition certifying that the $\hat{I}\pm$-edge-crossing width of $G$ is at most $2\hat{I}{\pm }^2+5k$ or confirms that the $\hat{I}\pm$-edge-crossing width of $G$ is more than $k$. As applications, for every fixed $\hat{I}\pm$, we obtain FPT algorithms for the List Coloring and Precoloring Extension problems parameterized by $\hat{I}\pm$-edge-crossing width. They were known to be W[1]-hard parameterized by tree-partition-width, and FPT parameterized by edge-cut width, and we close the complexity gap between these two parameters.

28 pages, 3 figures, accepted to WG2023