Chromatic numbers of integer distance graphs

DOI10.1016/S0012-365X(00)00243-0MaRDI QIDQ5936034zbMATH OpenOpenAlexWikidataFDO

Authors Arnfried Kemnitz, Massimiliano Marangio

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)

Review text

An integer distance graph is a graph \(G(D)\) with the set of integers as the vertex set and with an edge joining two vertices \(a\) and \(b\) iff \(|a-b|\in D\), where \(D\) is a subset of the positive integers. The authors determine the chromatic numbers of integer distance graphs (i) if \(D\) consists of two different positive integers together with their sum and their (positive) differences and (ii) with finite or infinite distance sets which are arithmetical sequences.

Recommendations

• Coloring of integer distance graphs
• Edge colorings and total colorings of integer distance graphs
• scientific article; zbMATH DE number 5026903
• scientific article; zbMATH DE number 2201392
• Integral distance graphs

Cited in

(34)

• Vertex arboricity of integer distance graph \(G(D_{m,k})\)
• On the chromatic number of circulant graphs
• On the chromatic number of special distance graphs
• Coloring planar Toeplitz graphs and the stable set polytope.
• Coloring of integer distance graphs
• 2-distance colorings of integer distance graphs
• Distance graphs with finite chromatic number
• Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\)
• Structural properties of Toeplitz graphs
• Distance graphs with maximum chromatic number
• Maximal density of sets with missing differences and various coloring parameters of distance graphs
• On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\)
• Colouring of distance graphs
• scientific article; zbMATH DE number 434901 (Why is no real title available?)
• scientific article; zbMATH DE number 4179396 (Why is no real title available?)
• scientific article; zbMATH DE number 3884193 (Why is no real title available?)
• Two Erdős problems on lacunary sequences: chromatic number and Diophantine approximation
• Proof of a conjecture on fractional Ramsey numbers
• On planar Toeplitz graphs
• scientific article; zbMATH DE number 4039934 (Why is no real title available?)
• scientific article; zbMATH DE number 57114 (Why is no real title available?)
• Integral distance graphs
• Distance Graphs on the Integers
• scientific article; zbMATH DE number 4118392 (Why is no real title available?)
• scientific article; zbMATH DE number 841654 (Why is no real title available?)
• Chromatic numbers of two-distance graphs in Q^2
• Distance graphs from \(p\)-adic norms
• Distance Graphs Generated by Five Primes (Research)
• Chromatic number of graphs with special distance sets. I
• On Hamiltonian paths in distance graphs
• Distance graph Ramsey sets
• Chromatic coloring of distance graphs, III
• The vertex linear arboricity of distance graphs
• Fractional chromatic number of distance graphs generated by two-interval sets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5936034)