### 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.

Original language | English |
---|---|

Place of Publication | Tilburg |

Publisher | Operations research |

Number of pages | 17 |

Volume | 2003-45 |

Publication status | Published - 2003 |

### Publication series

Name | CentER Discussion Paper |
---|---|

Volume | 2003-45 |

### Keywords

- graphs
- eigenvalues

## Fingerprint Dive into the research topics of '5-Chromatic Strongly Regular Graphs'. Together they form a unique fingerprint.

## Cite this

Fiala, N. C., & Haemers, W. H. (2003).

*5-Chromatic Strongly Regular Graphs*. (CentER Discussion Paper; Vol. 2003-45). Operations research.