Pages that link to "Item:Q2190920"
From MaRDI portal
The following pages link to Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size (Q2190920):
Displaying 7 items.
- Chromatic numbers of 3-dimensional distance graphs containing no tetrahedra (Q941905) (← links)
- Distance graphs having large chromatic numbers and containing no cliques or cycles of a given size (Q1761033) (← links)
- Chromatic numbers of spheres (Q1783626) (← links)
- Distance graphs with large chromatic number and without large cliques (Q1957062) (← links)
- Distance graphs with large chromatic number and without cliques of given size in the rational space (Q2282833) (← links)
- The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances (Q6048774) (← links)
- Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs (Q6055514) (← links)