Pages that link to "Item:Q2476275"
From MaRDI portal
The following pages link to Distance graphs with maximum chromatic number (Q2476275):
Displaying 10 items.
- Packing chromatic number of distance graphs (Q412353) (← links)
- On the chromatic number of integral circulant graphs (Q604055) (← links)
- On the independence ratio of distance graphs (Q738864) (← links)
- On the chromatic number of circulant graphs (Q1045059) (← links)
- Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) (Q1956238) (← links)
- Density of sets with missing differences and applications (Q2054653) (← links)
- On packing colorings of distance graphs (Q2440126) (← links)
- Maximal density of sets with missing differences and various coloring parameters of distance graphs (Q2663373) (← links)
- Solving lonely runner conjecture through differential geometry (Q2688813) (← links)
- Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem (Q5048455) (← links)
