A track layout of a graph is a partition of its vertices into linearly ordered independent sets, called tracks, such that no two edges between the same pair of tracks cross. Given a graph, the goal in this context is to determine its track number, that is, the minimum number of tracks required for the graph to admit a track layout. In this work, we present upper bounds on the track number of graphs admitting a product structure. Our main contribution is an algorithm that computes a track layout with at most $(2h+1) \cdot r \cdot tn(H)$ tracks for every subgraph of the strong product $P^h \boxtimes K_r \boxtimes H$, where $P^h$ is the $h$-th power of a path $P$, $K_r$ is the complete graph on $r$ vertices, and $H$ is a graph with track number $tn(H)$. Combined with existing product-structure results from the literature, this algorithm yields upper bounds on the track number of several graph classes. For planar graphs, the obtained bound matches the current best-known upper bound of $225$. For $1$-planar and optimal $2$-planar graphs, our algorithm yields track layouts with at most $375$ tracks, while for genus-$k$, $k$-planar, $k$-framed, $k$-map, and $k$-string graphs it provides track layouts with a number of tracks that depends solely on $k$, thus establishing new upper bounds on the track number for these graph classes. The algorithm runs in linear time for planar graphs and, more generally, in $O(n + h \cdot r \cdot t + f_t(H))$ time whenever a corresponding product-structure decomposition of the input $n$-vertex graph is provided as part of the input, where $t=tn(H)$ and $f_t(H)$ is the time needed to compute a $t$-track layout of $H$. Furthermore, our algorithm only uses elementary linked-list data structures.

翻译：暂无翻译