Upper bounds for the list-distinguishing chromatic number
Combinatorics
2025-07-23 v3
Abstract
We prove analogs of Brooks' Theorem for the list-distinguishing chromatic number of different classes of simple finite connected graphs. Moreover, we determine two 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 (for example: the book graphs).
Cite
@article{arxiv.2405.12733,
title = {Upper bounds for the list-distinguishing chromatic number},
author = {Amitayu Banerjee and Zalán Molnár and Alexa Gopaulsingh},
journal= {arXiv preprint arXiv:2405.12733},
year = {2025}
}
Comments
Revised version