Coloring of integer distance graphs
From MaRDI portal
Publication:1584411
DOI10.1016/S0012-365X(98)00099-5zbMath0956.05044MaRDI QIDQ1584411
Halka Kolberg, Arnfried Kemnitz
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (23)
Asymptotic clique covering ratios of distance graphs ⋮ The vertex linear arboricity of distance graphs ⋮ Structural properties of Toeplitz graphs ⋮ Connectedness of finite distance graphs ⋮ Maximal density of sets with missing differences and various coloring parameters of distance graphs ⋮ Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$ ⋮ On the density of integral sets with missing differences from sets related to arithmetic progressions ⋮ Distance Graphs Generated by Five Primes (Research) ⋮ The packing coloring of distance graphs \(D(k,t)\) ⋮ Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) ⋮ 2-distance colorings of integer distance graphs ⋮ Circular chromatic numbers of distance graphs with distance sets missing multiples ⋮ Fractional chromatic number of distance graphs generated by two-interval sets ⋮ Powers of cycles, powers of paths, and distance graphs ⋮ Circular chromatic numbers of some distance graphs ⋮ On the independence ratio of distance graphs ⋮ Sequences of integers with three missing separations ⋮ Connectivity and diameter in distance graphs ⋮ Vertex arboricity of integer distance graph \(G(D_{m,k})\) ⋮ Unnamed Item ⋮ Coloring of distance graphs with intervals as distance sets ⋮ Minimum chromaticity of circulant graphs ⋮ Distance graphs and \(T\)-coloring
Cites Work
This page was built for publication: Coloring of integer distance graphs