List Packing and Correspondence Packing of Planar Graphs (2401.01332v3)

Abstract: For a graph $G$ and a list assignment $L$ with $|L(v)|=k$ for all $v$, an $L$-packing consists of $L$-colorings $\varphi_1,\cdots,\varphi_k$ such that $\varphi_i(v)\ne\varphi_j(v)$ for all $v$ and all distinct $i,j\in{1,\ldots,k}$. Let $\chi^{\star}_{\ell}(G)$ denote the smallest $k$ such that $G$ has an $L$-packing for every $L$ with $|L(v)|=k$ for all $v$. Let $\mathcal{P}k$ denote the set of all planar graphs with girth at least $k$. We show that (i) $\chi^{\star}{\ell}(G)\le 8$ for all $G\in \mathcal{P}3$ and (ii) $\chi^{\star}{\ell}(G)\le 5$ for all $G\in \mathcal{P}4$ and (iii) $\chi^{\star}{\ell}(G)\le 4$ for all $G\in \mathcal{P}5$. Part (i) makes progress on a problem of Cambie, Cames van Batenburg, Davies, and Kang. We also construct outerplanar graphs $G$ such that $\chi^{\star}{\ell}(G)=4$, which matches the known upper bound $\chi^{\star}_{\ell}(G)\le 4$ for all outerplanar graphs. Finally, we consider the analogue of $\chi^{\star}_{\ell}$ for correspondence coloring, $\chi^{\star}_c$. In fact, all bounds stated above for $\chi^{\star}_{\ell}$ also hold for $\chi^{\star}_c$.