On 3-chromatic distance-regular graphs

DOI10.1007/S10623-007-9100-7MaRDI QIDQ2384050zbMATH OpenOpenAlexDBLPWikidataFDO

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

Publication date 20 September 2007

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

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

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

zbMATH Keywords

Chromatic numberDistance-regular graphs

Mathematics Subject Classification ID

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

Recommendations

• A valency bound for distance-regular graphs
• Distance-regularity and the spectrum of graphs
• scientific article; zbMATH DE number 4045789
• A characterization of distance-regular graphs with diameter three
• On the chromatic number of special distance graphs

Cites work

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

Cited in

(8)

• A valency bound for distance-regular graphs
• A characterization and an application of weight-regular partitions of graphs
• Three distance characteristic polynomials of some graphs
• scientific article; zbMATH DE number 6939351 (Why is no real title available?)
• Hoffman colorability of (strongly) regular graphs
• An improved bound on the chromatic number of the pancake graphs
• Hoffman colorings of graphs
• 3-bounded property in a triangle-free distance-regular graph

This page was built for publication: On 3-chromatic distance-regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2384050)