@techreport{db427efe6beb4e6f9e7e0b0d870283ad,
title = "On 3-Chromatic Distance-Regular Graphs",
abstract = "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.",
keywords = "distance-regular graphs, chromatic number",
author = "A. Blokhuis and A.E. Brouwer and W.H. Haemers",
note = "Subsequently published in Designs Codes and Cryptography in 2007 Pagination: 15",
year = "2006",
language = "English",
volume = "2006-120",
series = "CentER Discussion Paper",
publisher = "Operations research",
type = "WorkingPaper",
institution = "Operations research",
}