On the chromatic number of special distance graphs
From MaRDI portal
(Redirected from Publication:1184008)
Recommendations
Cites work
Cited in
(18)- Pattern periodic coloring of distance graphs
- Chromatic number of prime distance graphs
- Coloring of integer distance graphs
- Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\)
- On 3-chromatic distance-regular graphs
- Distance graphs on \(\mathbb R^n\) with 1-norm
- Minimum chromaticity of circulant graphs
- Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$
- On chromatic numbers of nearly Kneser distance graphs
- scientific article; zbMATH DE number 4144005 (Why is no real title available?)
- ON DISTANCES IN CHROMATIC GRAPHS
- Proof of a conjecture on fractional Ramsey numbers
- scientific article; zbMATH DE number 57114 (Why is no real title available?)
- scientific article; zbMATH DE number 1792623 (Why is no real title available?)
- Distance Graphs Generated by Five Primes (Research)
- On d-distance equitable chromatic number of some graphs
- Chromatic coloring of distance graphs \(\mathrm{V}\)
- A note on prime distance graphs with chromatic number 3 or 4
This page was built for publication: On the chromatic number of special distance graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1184008)