From rainbow to the lonely runner: A survey on coloring parameters of distances graphs
From MaRDI portal
Publication:947038
DOI10.11650/twjm/1500404981zbMath1168.05310MaRDI QIDQ947038
Publication date: 29 September 2008
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.11650/twjm/1500404981
Related Items
Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem, Distance Graphs Generated by Five Primes (Research), Germ order for one-dimensional packings, Maximal density and the kappa values for the families \(\{a,a+1,2a+1,n\}\) and \(\{a,a+1,2a+1,3a+1,n\}\), Chromatic numbers of Cayley graphs of abelian groups: a matrix method, Packing chromatic number of distance graphs, On the independence ratio of distance graphs, The lonely runner problem for lacunary sequences, 2-distance colorings of integer distance graphs, Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\), On optimal \(M\)-sets related to Motzkin's problem, Density of sets with missing differences and applications, Domination ratio of a family of integer distance digraphs with arbitrary degree, On Motzkin's problem in the circle group, Sequences of integers with three missing separations, On packing colorings of distance graphs, Maximal density of sets with missing differences and various coloring parameters of distance graphs, Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$
