Coloring semiminimal Cayley Graphs
arXiv:2607.26942
summary
The paper proves that semiminimal Cayley graphs of abelian and generalized dihedral groups have circular chromatic number at most 4, extending earlier results and addressing a question of Babai.
Abstract
In 1978 Babai raised the question whether all semiminimal Cayley graphs have bounded chromatic number. In this paper we show that semiminimal Cayley graphs of abelian and generalized dihedral groups have circular chromatic number at most 4, thus extending a result of Barajas and Serra.
11 pages
Topics & keywords
#cayley graphs#semiminimal graphs#circular chromatic number#abelian groups#generalized dihedral groupscircular chromatic numbersemiminimalabelian groupsgeneralized dihedral groupsgraph coloring