The following pages link to (Q4552213):
Displaying 14 items.
- Fractional chromatic number of distance graphs generated by two-interval sets (Q942143) (← links)
- Distance graphs and the \(T\)-coloring problem (Q1297406) (← links)
- Distance graphs and \(T\)-coloring (Q1305534) (← links)
- Asymptotic clique covering ratios of distance graphs (Q1612760) (← links)
- Circular chromatic numbers of some distance graphs (Q1773363) (← links)
- No-hole \(k\)-tuple \((r+1)\)-distant colorings (Q1917240) (← links)
- No-hole \(k\)-tuple \((r+1)\)-distant colorings of odd cycles (Q1917241) (← links)
- Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) (Q1956238) (← links)
- On optimal \(M\)-sets related to Motzkin's problem (Q1983376) (← links)
- Coloring of distance graphs with intervals as distance sets (Q2567207) (← links)
- (Q2959659) (← links)
- (Q3737452) (← links)
- The χt-coloring problem (Q4596640) (← links)
- Distance Graphs Generated by Five Primes (Research) (Q5118660) (← links)
