Answers are grounded in this paper and cite their sources.
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).
No takes yet. Share an insight, caveat, or question.
Banerjee et al. (2024) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: