Fiala, N.C.; Haemers, W.H. - Tilburg University, Center for Economic Research - 2003
In this paper, we begin the determination of all primitive strongly regular graphs with chromatic number equal to 5.Using eigenvalue techniques, we show that there are at most 43 possible parameter sets for such a graph.For each parameter set, we must decide which strongly regular graphs, if...