Pages that link to "Item:Q2567207"
From MaRDI portal
The following pages link to Coloring of distance graphs with intervals as distance sets (Q2567207):
Displaying 21 items.
- On the density of integral sets with missing differences from sets related to arithmetic progressions (Q627623) (← links)
- On the independence ratio of distance graphs (Q738864) (← links)
- Fractional chromatic number of distance graphs generated by two-interval sets (Q942143) (← links)
- From rainbow to the lonely runner: A survey on coloring parameters of distances graphs (Q947038) (← links)
- Circular chromatic numbers and fractional chromatic numbers of distance graphs (Q1266350) (← links)
- Asymptotic clique covering ratios of distance graphs (Q1612760) (← links)
- Distant set distinguishing edge colourings of graphs (Q1686263) (← links)
- Circular chromatic numbers of some distance graphs (Q1773363) (← links)
- Circular chromatic numbers of a class of distance graphs (Q1874370) (← links)
- Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) (Q1956238) (← links)
- Sequences of integers with three missing separations (Q2297912) (← links)
- Tree coloring of distance graphs with a real interval set (Q2481438) (← links)
- On Distance Coloring (Q2897959) (← links)
- (Q2959659) (← links)
- Fractional chromatic number and circular chromatic number for distance graphs with large clique size (Q3159396) (← links)
- Sum coloring of distance and circulant graphs (Q3439341) (← links)
- Extreme Distances in Multicolored Point Sets (Q4679079) (← links)
- Circular chromatic number of distance graphs with distance sets of cardinality 3 (Q4798114) (← links)
- Distance Graphs Generated by Five Primes (Research) (Q5118660) (← links)
- (Q5461468) (← links)
- (Q5468433) (← links)
