Chromatic numbers of integer distance graphs

DOI10.1016/S0012-365X(00)00243-0zbMath0988.05039OpenAlexW2074030300WikidataQ127212410 ScholiaQ127212410MaRDI QIDQ5936034

Massimiliano Marangio, Arnfried Kemnitz

Publication date: 22 July 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00243-0

zbMATH Keywords

chromatic numbersinteger distance graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (15)

The vertex linear arboricity of distance graphs ⋮ Structural properties of Toeplitz graphs ⋮ On planar Toeplitz graphs ⋮ Maximal density of sets with missing differences and various coloring parameters of distance graphs ⋮ Chromatic coloring of distance graphs, III ⋮ Distance Graphs Generated by Five Primes (Research) ⋮ On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\) ⋮ Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) ⋮ Coloring planar Toeplitz graphs and the stable set polytope. ⋮ Proof of a conjecture on fractional Ramsey numbers ⋮ Fractional chromatic number of distance graphs generated by two-interval sets ⋮ Distance graphs with maximum chromatic number ⋮ On Hamiltonian paths in distance graphs ⋮ Vertex arboricity of integer distance graph \(G(D_{m,k})\) ⋮ On the chromatic number of circulant graphs

This page was built for publication: Chromatic numbers of integer distance graphs