On 3-chromatic distance-regular graphs

DOI10.1007/s10623-007-9100-7zbMath1123.05094OpenAlexW3122015656WikidataQ30052717 ScholiaQ30052717MaRDI QIDQ2384050

Andries E. Brouwer, Willem H. Haemers, Aart Blokhuis

Publication date: 20 September 2007

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-007-9100-7

zbMATH Keywords

Chromatic numberDistance-regular graphs

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Coloring of graphs and hypergraphs (05C15)

Related Items

A characterization and an application of weight-regular partitions of graphs, A valency bound for distance-regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The P-geometry for \(M_{23}\) has no non-trivial 2-coverings
• 5-chromatic strongly regular graphs
• The structure of near polygons with quads
• The chromatic number of the product of two 4-chromatic graphs is 4
• On the chromatic number of cube-like graphs
• Some simplified NP-complete graph problems
• There exists no distance-regular graph with intersection array \((5,4,3;1,1,2)\)
• Near polygons and Fischer spaces
• A computer-assisted proof of the uniqueness of the Perkel graph
• The uniqueness of the near hexagon on 729 points
• The chromatic number of extended odd graphs is four