Recommendations
Cited in
(62)- Chromatic coloring of distance graphs \(\mathrm{V}\)
- scientific article; zbMATH DE number 5844107 (Why is no real title available?)
- Chromatic coloring of distance graphs, III
- Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs
- Chromatic numbers of Cayley graphs of abelian groups: a matrix method
- Circular chromatic numbers of distance graphs with distance sets missing multiples
- Distances forbidden by two-colorings of \(\mathbb{Q}^ 3\) and \(A_ n\)
- Coloring Toeplitz graphs
- On the independence ratio of distance graphs
- On the density of integral sets with missing differences from sets related to arithmetic progressions
- Algebraic Distance Graphs and Rigidity
- On the chromatic number of Toeplitz graphs
- Distance graphs with maximum chromatic number
- On Hamiltonian paths in distance graphs
- Radio labelings of distance graphs
- Fractional chromatic number of distance graphs generated by two-interval sets
- Threshold-coloring and unit-cube contact representation of planar graphs
- Coloring distance graphs on the plane
- Vertex-colouring of 3-chromatic circulant graphs
- Distance graphs and the \(T\)-coloring problem
- Weak unit disk and interval representation of graphs
- Connectivity of distance graphs
- Distance graphs on \(\mathbb R^n\) with 1-norm
- Invisible runners in finite fields
- The vertex linear arboricity of distance graphs
- Constructively coloring the line
- scientific article; zbMATH DE number 2188438 (Why is no real title available?)
- Sequences of integers with three missing separations
- Vertex arboricity of integer distance graph \(G(D_{m,k})\)
- Distance graphs and \(T\)-coloring
- Connectivity and diameter in distance graphs
- Packing chromatic number of distance graphs
- Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\)
- Coloring of integer distance graphs
- Pattern periodic coloring of distance graphs
- Powers of cycles, powers of paths, and distance graphs
- Connectedness of finite distance graphs
- Colouring prime distance graphs
- Distance Graphs Generated by Five Primes (Research)
- Asymptotic clique covering ratios of distance graphs
- Sum coloring of distance and circulant graphs
- Bipartite finite Toeplitz graphs
- Long cycles and paths in distance graphs
- Finite-dimensional \(T\)-colorings of graphs
- Coloring planar Toeplitz graphs and the stable set polytope.
- Prime power and prime product distance graphs
- Lonely runner polyhedra
- On the chromatic number of circulant graphs
- On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\)
- Graph colourings and partitions
- The chromatic numbers of distance graphs
- On finite prime distance graphs
- Distance graphs and arithmetic progressions
- The packing coloring of distance graphs \(D(k,t)\)
- On packing colorings of distance graphs
- Finite prime distance graphs and 2-odd graphs
- Distance graphs with finite chromatic number
- Circular chromatic numbers of some distance graphs
- Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$
- Tree coloring of distance graphs with a real interval set
- Coloring of distance graphs with intervals as distance sets
- Proof of a conjecture on fractional Ramsey numbers
This page was built for publication: Colouring the real line
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800371)
