On 3-chromatic distance-regular graphs

A. Blokhuis, A.E. Brouwer, W.H. Haemers

Research output: Contribution to journalArticleAcademicpeer-review

4 Citations (Scopus)


We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adjacency matrix. For all known distance-regular graphs it is determined whether they are 3-chromatic. A start is made with the classification of 3-chromatic distance-regular graphs, and it is shown that such graphs, if not complete 3-partite, must have ¿ = 1.
Original languageEnglish
Pages (from-to)293-305
JournalDesigns, Codes and Cryptography
Issue number1-3
Publication statusPublished - 2007


Dive into the research topics of 'On 3-chromatic distance-regular graphs'. Together they form a unique fingerprint.

Cite this