Distance graphs with finite chromatic number

DOI10.1006/JCTB.2001.2093zbMath1027.05036OpenAlexW2031636714MaRDI QIDQ1850605

Zsolt Tuza, Margit Voigt, Imre Z. Ruzsa

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (22)

An approximation property of lacunary sequences ⋮ Density modulo 1 of sublacunary sequences ⋮ On the time for a runner to get lonely ⋮ On a sequence related to that of Thue-Morse and its applications ⋮ Coloring distance graphs on the plane ⋮ Chromatic coloring of distance graphs, III ⋮ Packing chromatic number of distance graphs ⋮ Random runners are very lonely ⋮ On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\) ⋮ The lonely runner problem for lacunary sequences ⋮ The packing coloring of distance graphs \(D(k,t)\) ⋮ Unnamed Item ⋮ Some remarks on the lonely runner conjecture ⋮ Biclique-colouring verification complexity and biclique-colouring power graphs ⋮ Colorings of the space \(\mathbb R^{n}\) with several forbidden distances ⋮ Distance graphs with maximum chromatic number ⋮ On the independence ratio of distance graphs ⋮ Monochromatic paths for the integers ⋮ On types of growth for graph-different permutations ⋮ On the chromatic number of circulant graphs ⋮ Locating chromatic number of powers of paths and cycles ⋮ Sum coloring of distance and circulant graphs

Cites Work

• Unnamed Item
• Colouring the real line
• Pattern periodic coloring of distance graphs
• The view-obstruction problem for \(n\)-dimensional cubes
• Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen
• Circular chromatic number of distance graphs with distance sets of cardinality 3

This page was built for publication: Distance graphs with finite chromatic number