Pages that link to "Item:Q1957062"
From MaRDI portal
The following pages link to Distance graphs with large chromatic number and without large cliques (Q1957062):
Displaying 13 items.
- On large subgraphs with small chromatic numbers contained in distance graphs (Q289740) (← links)
- The chromatic number of space with forbidden regular simplex (Q679877) (← links)
- Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space (Q762489) (← links)
- On the structure of distance graphs with large chromatic numbers (Q881128) (← links)
- Chromatic numbers of 3-dimensional distance graphs containing no tetrahedra (Q941905) (← links)
- On the chromatic numbers of rational spaces (Q1646347) (← links)
- Distance graphs having large chromatic numbers and containing no cliques or cycles of a given size (Q1761033) (← links)
- Distance graphs with large chromatic number and arbitrary girth (Q1946751) (← links)
- Chromatic numbers of distance graphs without short odd cycles in rational spaces (Q2037721) (← links)
- Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size (Q2190920) (← links)
- Distance graphs with large chromatic number and without cliques of given size in the rational space (Q2282833) (← links)
- Lower bounds for the chromatic numbers of distance graphs with large girth (Q2364552) (← links)
- Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii (Q5396969) (← links)
