Skip to content
DraconiticResearch
Search Sources API
185,139 studies31 sourcesUpdated 53 min ago
PreprintCC BY 4.0HAL

COLORING SEMIMINIMAL CAYLEY GRAPHS

  • Ignacio Garc Ía-Marco
  • Kolja Knauer
  • Giuliamaria Menara
Open at sourcePDFCite

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 of arbitrary cardinality have circular chromatic number at most 4, thus extending a result of Barajas and Serra.

Related

  1. Coloring sparse random Cayley graphs
    Nathan Tung
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  2. Coloring Monomial Cayley Graphs: The One-Parameter Case
    Jonathan Davidson
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  3. Minimal Cayley graphs with large chromatic number
    James Davies, Meike Hatzel, Liana Yepremyan
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  4. Bounds for B-coloring planar and outerplanar graphs
    Ryan Martin, Miklós Ruszinkó, Gábor Sárközy
    Discrete MathematicsPeer-reviewedLicence not statedCombinatorics & discrete mathematicsHAL
  5. Odd-ordered Cayley graphs satisfy Erdős--Gyárfás
    Michael C. Burkhart
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{iamarco2026coloring,
  title = {{COLORING SEMIMINIMAL CAYLEY GRAPHS}},
  author = {Ignacio Garc Ía-Marco and Kolja Knauer and Giuliamaria Menara},
  howpublished = {HAL},
  year = {2026},
  month = sep,
  url = {https://hal.science/hal-05737730v1},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - COLORING SEMIMINIMAL CAYLEY GRAPHS
AU  - Ignacio Garc Ía-Marco
AU  - Kolja Knauer
AU  - Giuliamaria Menara
PY  - 2026
DA  - 2026/09/03
PB  - HAL
UR  - https://hal.science/hal-05737730v1
AB  - 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 of arbitrary cardinality have circular chromatic number at most 4, thus extending a result of Barajas and Serra.
ER  -