Distance graphs with finite chromatic number
From MaRDI portal
Publication:1850605
DOI10.1006/JCTB.2001.2093zbMATH Open1027.05036OpenAlexW2031636714MaRDI QIDQ1850605FDOQ1850605
Authors: Zsolt Tuza, Imre Z. Ruzsa, Margit Voigt 
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.2001.2093
Recommendations
Cites Work
- The view-obstruction problem for \(n\)-dimensional cubes
- Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen
- Title not available (Why is that?)
- Colouring the real line
- Pattern periodic coloring of distance graphs
- Circular chromatic number of distance graphs with distance sets of cardinality 3
Cited In (35)
- Colorings of the space \(\mathbb R^{n}\) with several forbidden distances
- On the fractional parts of lacunary sequences
- On types of growth for graph-different permutations
- Locating chromatic number of powers of paths and cycles
- An approximation property of lacunary sequences
- Asymptotic clique covering ratios of distance graphs
- Random runners are very lonely
- Distance graphs with large chromatic number and arbitrary girth
- Some remarks on the lonely runner conjecture
- ON DISTANCES IN CHROMATIC GRAPHS
- On a sequence related to that of Thue-Morse and its applications
- On the independence ratio of distance graphs
- Monochromatic paths for the integers
- Density modulo 1 of sublacunary sequences
- Packing chromatic number of distance graphs
- Coloring the real line with monochromatic intervals
- Two Erdős problems on lacunary sequences: chromatic number and Diophantine approximation
- Coloring distance graphs on the plane
- On the chromatic number of circulant graphs
- Title not available (Why is that?)
- Distance graphs with maximum chromatic number
- Integral distance graphs
- Sum coloring of distance and circulant graphs
- On the time for a runner to get lonely
- Distance graphs and arithmetic progressions
- Coloring of \(n\)-dimensional distance graphs
- Biclique-colouring verification complexity and biclique-colouring power graphs
- Coloring integral distance graphs with finite distance sets
- Chromatic coloring of distance graphs, III
- On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\)
- Distance graphs from \(p\)-adic norms
- The lonely runner problem for lacunary sequences
- The packing coloring of distance graphs \(D(k,t)\)
- Title not available (Why is that?)
- On the Canonical Version of a Theorem in Ramsey Theory
This page was built for publication: Distance graphs with finite chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850605)
