Key points are not available for this paper at this time.
We prove analogs of Brooks' Theorem for the list distinguishing chromatic number of finite connected graphs. We also determine the list distinguishing chromatic number for various families of graphs (example: the book graphs).
Banerjee et al. (2024) studied this question.