Pages that link to "Item:Q259909"
From MaRDI portal
The following pages link to Independence numbers and chromatic numbers of some distance graphs (Q259909):
Displaying 9 items.
- On the number of edges of a uniform hypergraph with a range of allowed intersections (Q2190888) (← links)
- Chromatic numbers of some distance graphs (Q2191956) (← links)
- Chromatic numbers of Kneser-type graphs (Q2299637) (← links)
- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\) (Q2313252) (← links)
- On chromatic numbers of close-to-Kneser distance graphs (Q2364457) (← links)
- On the number of edges in a uniform hypergraph with a range of permitted intersections (Q2411798) (← links)
- Independence number and packing coloring of generalized Mycielski graphs (Q2656330) (← links)
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs (Q3466410) (← links)
- Chromatic number, independence ratio, and crossing number (Q3535837) (← links)
