Colouring of distance graphs
From MaRDI portal
For a set \(D\) of positive integers, the distance graph \(G(D)\) has the integers as vertex set and two integers \(u,v\) are adjacent if \(|u-v|\in D\). The question of determining the chromatic number of distance graphs and first results can be found in \textit{R. B. Eggleton, P. Erdős}, and \textit{D. K. Skilton} [J. Comb. Theory, Ser. B 39, 86-100 (1985; Zbl 0549.05029)]. The author made a good progress towards answering this question for all three-element sets \(D\).
Recommendations
Cited in
(40)- On coloring the odd-distance graph
- On the chromatic number of circulant graphs
- Pattern periodic coloring of distance graphs
- Distance graphs and the T-coloring problem
- Distance graphs and \(T\)-coloring
- The chromatic numbers of distance graphs
- Coloring of integer distance graphs
- Asymptotic clique covering ratios of distance graphs
- Distant set distinguishing edge colourings of graphs
- Circular chromatic numbers of some distance graphs
- Distance graphs with finite chromatic number
- Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\)
- Sequences of integers with three missing separations
- Distance graphs with maximum chromatic number
- Coloring of distance graphs with intervals as distance sets
- Maximal density of sets with missing differences and various coloring parameters of distance graphs
- Connectivity and diameter in distance graphs
- Coloring blocks of consecutive integers to forbid three distances
- Coloring the real line with monochromatic intervals
- scientific article; zbMATH DE number 4144005 (Why is no real title available?)
- scientific article; zbMATH DE number 1735660 (Why is no real title available?)
- Integral distance graphs
- scientific article; zbMATH DE number 1792623 (Why is no real title available?)
- Distance Graphs on the Integers
- Distance Graphs Generated by Five Primes (Research)
- scientific article; zbMATH DE number 2201392 (Why is no real title available?)
- Powers of cycles, powers of paths, and distance graphs
- On Hamiltonian paths in distance graphs
- Distance graph Ramsey sets
- scientific article; zbMATH DE number 5026903 (Why is no real title available?)
- On 2-coloring the integers to forbid a distance and monochromatic translates of a triangle
- Chromatic coloring of distance graphs \(\mathrm{V}\)
- Long cycles and paths in distance graphs
- Distance edge-colourings and matchings
- The distance coloring of graphs
- Colouring the real line
- The vertex linear arboricity of distance graphs
- Colouring prime distance graphs
- Fractional chromatic number of distance graphs generated by two-interval sets
- From rainbow to the lonely runner: A survey on coloring parameters of distances graphs
This page was built for publication: Colouring of distance graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2760982)
