List Coloring of some Cayley graphs using Kernel perfections
Combinatorics
2024-02-27 v1 Discrete Mathematics
Data Structures and Algorithms
Abstract
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.
Keywords
Cite
@article{arxiv.2402.16047,
title = {List Coloring of some Cayley graphs using Kernel perfections},
author = {Prajnanaswaroopa S},
journal= {arXiv preprint arXiv:2402.16047},
year = {2024}
}
Comments
3 pages, short paper