From rainbow to the lonely runner: A survey on coloring parameters of distances graphs

DOI10.11650/twjm/1500404981zbMath1168.05310OpenAlexW1925734015MaRDI QIDQ947038

Daphne Der-Fen Liu

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

zbMATH Keywords

distance graphsplane coloring problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Density, gaps, topology (11B05)

Related Items (18)

Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem ⋮ Domination ratio of a family of integer distance digraphs with arbitrary degree ⋮ Maximal density of sets with missing differences and various coloring parameters of distance graphs ⋮ Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$ ⋮ Packing chromatic number of distance graphs ⋮ 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 ⋮ Distance Graphs Generated by Five Primes (Research) ⋮ The lonely runner problem for lacunary sequences ⋮ On packing colorings of distance graphs ⋮ Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) ⋮ 2-distance colorings of integer distance graphs ⋮ On Motzkin's problem in the circle group ⋮ On optimal \(M\)-sets related to Motzkin's problem ⋮ Germ order for one-dimensional packings ⋮ On the independence ratio of distance graphs ⋮ Sequences of integers with three missing separations ⋮ Density of sets with missing differences and applications

This page was built for publication: From rainbow to the lonely runner: A survey on coloring parameters of distances graphs