Pages that link to "Item:Q1184008"
From MaRDI portal
The following pages link to On the chromatic number of special distance graphs (Q1184008):
Displaying 15 items.
- On chromatic numbers of nearly Kneser distance graphs (Q334403) (← links)
- Pattern periodic coloring of distance graphs (Q1127883) (← links)
- Chromatic number of prime distance graphs (Q1329821) (← links)
- Coloring of integer distance graphs (Q1584411) (← links)
- Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) (Q1956238) (← links)
- On 3-chromatic distance-regular graphs (Q2384050) (← links)
- Distance graphs on \(\mathbb R^n\) with 1-norm (Q2471053) (← links)
- Minimum chromaticity of circulant graphs (Q2568490) (← links)
- Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$ (Q2946061) (← links)
- ON DISTANCES IN CHROMATIC GRAPHS (Q3480062) (← links)
- Proof of a conjecture on fractional Ramsey numbers (Q3553231) (← links)
- (Q4005786) (← links)
- (Q4552213) (← links)
- Distance Graphs Generated by Five Primes (Research) (Q5118660) (← links)
- Chromatic coloring of distance graphs \(\mathrm{V}\) (Q6625099) (← links)
