  We prove analogs of Brooks' Theorem for the list-distinguishing chromatic
number of finite connected graphs. Moreover, we give new examples to determine
two sharp upper bounds for the list-distinguishing chromatic number of a graph
G in terms of the coloring number of G and the list-chromatic number of G. We
also determine the list-distinguishing chromatic number for various families of
graphs (example: the book graphs).
