From rainbow to the lonely runner: A survey on coloring parameters of distances graphs
From MaRDI portal
Publication:947038
DOI10.11650/TWJM/1500404981zbMATH Open1168.05310OpenAlexW1925734015MaRDI QIDQ947038FDOQ947038
Authors: 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
Recommendations
Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Density, gaps, topology (11B05)
Cited In (20)
- On optimal \(M\)-sets related to Motzkin's problem
- Germ order for one-dimensional packings
- Chromatic numbers of Cayley graphs of abelian groups: a matrix method
- On Motzkin's problem in the circle group
- Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem
- Maximal density and the kappa values for the families \(\{a,a+1,2a+1,n\}\) and \(\{a,a+1,2a+1,3a+1,n\}\)
- On the independence ratio of distance graphs
- Packing chromatic number of distance graphs
- Distance Graphs Generated by Five Primes (Research)
- On packing colorings of distance graphs
- Density of sets with missing differences and applications
- Sequences of integers with three missing separations
- Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\)
- Distance graphs and arithmetic progressions
- Domination ratio of a family of integer distance digraphs with arbitrary degree
- A survey on the distance-colouring of graphs
- Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$
- Maximal density of sets with missing differences and various coloring parameters of distance graphs
- The lonely runner problem for lacunary sequences
- 2-distance colorings of integer distance graphs
This page was built for publication: From rainbow to the lonely runner: A survey on coloring parameters of distances graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q947038)
