List Coloring of some Cayley graphs using Kernel perfections
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914692221370368 |
|---|---|
| author | S, Prajnanaswaroopa |
| author_facet | S, Prajnanaswaroopa |
| contents | In this paper, we try to determine exact or bounds on the choosability, or list chromatic numbers of some Cayley graphs, typically some Unitary Cayley graphs and Cayley graphs on Dihedral groups. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_16047 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | List Coloring of some Cayley graphs using Kernel perfections S, Prajnanaswaroopa Combinatorics Discrete Mathematics Data Structures and Algorithms 05C15, 05C25 G.2.1; G.2.2 In this paper, we try to determine exact or bounds on the choosability, or list chromatic numbers of some Cayley graphs, typically some Unitary Cayley graphs and Cayley graphs on Dihedral groups. |
| title | List Coloring of some Cayley graphs using Kernel perfections |
| topic | Combinatorics Discrete Mathematics Data Structures and Algorithms 05C15, 05C25 G.2.1; G.2.2 |
| url | https://arxiv.org/abs/2402.16047 |