On the chromatic number of special distance graphs

DOI10.1016/0012-365X(91)90454-AzbMath0753.05038OpenAlexW2040155637MaRDI QIDQ1184008

Hansjoachim Walther, Margit Voigt

Publication date: 28 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90454-a

zbMATH Keywords

chromatic numberdistance graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (9)

Chromatic number of prime distance graphs ⋮ Pattern periodic coloring of distance graphs ⋮ Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$ ⋮ Distance Graphs Generated by Five Primes (Research) ⋮ Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) ⋮ Proof of a conjecture on fractional Ramsey numbers ⋮ Distance graphs on \(\mathbb R^n\) with 1-norm ⋮ Minimum chromaticity of circulant graphs ⋮ Coloring of integer distance graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A LINEAR DIOPHANTINE EQUATION WITH APPLICATIONS TO NON‐NEGATIVE MATRICES

This page was built for publication: On the chromatic number of special distance graphs