### Abstract

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 |

### Fingerprint

### Keywords

- graphs
- eigenvalues

### Cite this

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

}

**5-Chromatic Strongly Regular Graphs.** / Fiala, N.C.; Haemers, W.H.

Research output: Working paper › Discussion paper › Other research output

TY - UNPB

T1 - 5-Chromatic Strongly Regular Graphs

AU - Fiala, N.C.

AU - Haemers, W.H.

N1 - Pagination: 17

PY - 2003

Y1 - 2003

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

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

KW - graphs

KW - eigenvalues

M3 - Discussion paper

VL - 2003-45

T3 - CentER Discussion Paper

BT - 5-Chromatic Strongly Regular Graphs

PB - Operations research

CY - Tilburg

ER -