List colouring is an influential and classic topic in graph theory. We initiate the study of a natural strengthening of this problem, where instead of one list-colouring, we seek many in parallel. Our explorations have uncovered a potentially rich seam of interesting problems spanning chromatic graph theory. Given a $k$-list-assignment $L$ of a graph $G$, which is the assignment of a list $L(v)$ of $k$ colours to each vertex $v\in V(G)$, we study the existence of $k$ pairwise-disjoint proper colourings of $G$ using colours from these lists. We may refer to this as a \emph{list-packing}. Using a mix of combinatorial and probabilistic methods, we set out some basic upper bounds on the smallest $k$ for which such a list-packing is always guaranteed, in terms of the number of vertices, the degeneracy, the maximum degree, or the (list) chromatic number of $G$. (The reader might already find it interesting that such a minimal $k$ is well defined.) We also pursue a more focused study of the case when $G$ is a bipartite graph. Our results do not yet rule out the tantalising prospect that the minimal $k$ above is not too much larger than the list chromatic number. Our study has taken inspiration from study of the strong chromatic number, and we also explore generalisations of the problem above in the same spirit.

翻译：列表颜色在图形理论中是一个有影响和经典的话题。 我们开始研究这一问题的自然强化问题, 而不是一个列表颜色, 我们在此同时寻找很多。 我们的探索发现了一个可能富饶的、 包括染色图理论在内的有趣的问题。 使用组合式和预测性方法的组合, 我们设置了一些基本上限, 最小的 $K $G$, 即列表包装总是得到保证的 $L (v) $k$ 。 列表为每个 vertex $v\ in V( G) $, 我们用这些列表中的颜色来研究是否存在美元对调合合的美元正配色。 使用这些颜色, 我们可能会将此称为 \ emph{ list- 包装} 。 使用组合式和 robabableical 的混合方法, 我们为最小的 $( $) 美元( $ ) 设置了某些基本上限的上限, 而在我们研究中, 最起码的金额( list) $( nucial) excial) excial extial exis a excial excial excial exmission (我们研究中, 我们的最小的 extiquest legre extiquest le legent le) a le a legent legent) a ex legental ex ex ex ex ex ex ex ex ex ex ex ex.