Upper bounds for the list-distinguishing chromatic number
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911068373123072 |
|---|---|
| author | Banerjee, Amitayu Molnár, Zalán Gopaulsingh, Alexa |
| author_facet | Banerjee, Amitayu Molnár, Zalán Gopaulsingh, Alexa |
| contents | 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). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_12733 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Upper bounds for the list-distinguishing chromatic number Banerjee, Amitayu Molnár, Zalán Gopaulsingh, Alexa Combinatorics 05C15, 05C25, 05C07 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). |
| title | Upper bounds for the list-distinguishing chromatic number |
| topic | Combinatorics 05C15, 05C25, 05C07 |
| url | https://arxiv.org/abs/2405.12733 |