TY - JOUR
T1 - The chromatic index of strongly regular graphs
AU - Cioabă, Sebastian M.
AU - Guo, Krystal
AU - Haemers, W. H.
PY - 2021
Y1 - 2021
N2 - We determine (partly by computer search) the chromatic index (edge-chromatic number) of many strongly regular graphs (SRGs), including the SRGs of degree k ≤ 18 and their complements, the Latin square graphs and their complements, and the triangular graphs and their complements. Moreover, using a recent result of Ferber and Jain, we prove that an SRG of even order n, which is not the block graph of a Steiner 2-design or its complement, has chromatic index k, when n is big enough. Except for the Petersen graph, all investigated connected SRGs of even order have chromatic index equal to k, i.e., they are class 1, and we conjecture that this is the case for all connected SRGs of even order.
AB - We determine (partly by computer search) the chromatic index (edge-chromatic number) of many strongly regular graphs (SRGs), including the SRGs of degree k ≤ 18 and their complements, the Latin square graphs and their complements, and the triangular graphs and their complements. Moreover, using a recent result of Ferber and Jain, we prove that an SRG of even order n, which is not the block graph of a Steiner 2-design or its complement, has chromatic index k, when n is big enough. Except for the Petersen graph, all investigated connected SRGs of even order have chromatic index equal to k, i.e., they are class 1, and we conjecture that this is the case for all connected SRGs of even order.
U2 - 10.26493/1855-3974.2435.ec9
DO - 10.26493/1855-3974.2435.ec9
M3 - Article
SN - 1855-3966
VL - 20
SP - 187
EP - 194
JO - Ars Mathematica Contemporanea
JF - Ars Mathematica Contemporanea
IS - 2
ER -