Coloring semiminimal Cayley Graphs
Combinatorics
2026-07-29 v1
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.
Cite
@article{arxiv.2607.26942,
title = {Coloring semiminimal Cayley Graphs},
author = {Ignacio García-Marco and Kolja Knauer and Giuliamaria Menara},
journal= {arXiv preprint arXiv:2607.26942},
year = {2026}
}
Comments
11 pages