Pages that link to "Item:Q1850605"
From MaRDI portal
The following pages link to Distance graphs with finite chromatic number (Q1850605):
Displaying 22 items.
- Packing chromatic number of distance graphs (Q412353) (← links)
- Random runners are very lonely (Q423640) (← links)
- Biclique-colouring verification complexity and biclique-colouring power graphs (Q491598) (← links)
- On the independence ratio of distance graphs (Q738864) (← links)
- Monochromatic paths for the integers (Q739070) (← links)
- An approximation property of lacunary sequences (Q839907) (← links)
- On a sequence related to that of Thue-Morse and its applications (Q870969) (← links)
- On types of growth for graph-different permutations (Q1024371) (← links)
- On the chromatic number of circulant graphs (Q1045059) (← links)
- The lonely runner problem for lacunary sequences (Q1709528) (← links)
- On the time for a runner to get lonely (Q2159728) (← links)
- Locating chromatic number of powers of paths and cycles (Q2335071) (← links)
- Density modulo 1 of sublacunary sequences (Q2388189) (← links)
- The packing coloring of distance graphs \(D(k,t)\) (Q2440104) (← links)
- Colorings of the space \(\mathbb R^{n}\) with several forbidden distances (Q2473753) (← links)
- Distance graphs with maximum chromatic number (Q2476275) (← links)
- On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\) (Q2698203) (← links)
- Some remarks on the lonely runner conjecture (Q3120645) (← links)
- (Q3390431) (← links)
- Sum coloring of distance and circulant graphs (Q3439341) (← links)
- Coloring distance graphs on the plane (Q6046170) (← links)
- Chromatic coloring of distance graphs, III (Q6113545) (← links)
