@techreport{16d4bde1141a428d9633b3aba28e7ebb,
title = "5-Chromatic Strongly Regular Graphs",
abstract = "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 any, possessing the set are 5-chromatic.In this way, we deal completely with 34 of these parameter sets using eigenvalue techniques and computer enumerations.",
keywords = "graphs, eigenvalues",
author = "N.C. Fiala and W.H. Haemers",
note = "Pagination: 17",
year = "2003",
language = "English",
volume = "2003-45",
series = "CentER Discussion Paper",
publisher = "Operations research",
type = "WorkingPaper",
institution = "Operations research",
}