Chromatic number of prime distance graphs
From MaRDI portal
Publication:1329821
DOI10.1016/0166-218X(94)90109-0zbMath0808.05051MaRDI QIDQ1329821
Hansjoachim Walther, Margit Voigt
Publication date: 9 March 1995
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (22)
Asymptotic clique covering ratios of distance graphs ⋮ The vertex linear arboricity of distance graphs ⋮ Pattern periodic coloring of distance graphs ⋮ Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$ ⋮ Finite prime distance graphs and 2-odd graphs ⋮ Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs ⋮ Packing chromatic number of distance graphs ⋮ Distance Graphs Generated by Five Primes (Research) ⋮ On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\) ⋮ On packing colorings of distance graphs ⋮ Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) ⋮ Prime power and prime product distance graphs ⋮ Circular chromatic numbers of distance graphs with distance sets missing multiples ⋮ Fractional chromatic number of distance graphs generated by two-interval sets ⋮ Distance graphs on \(\mathbb R^n\) with 1-norm ⋮ Powers of cycles, powers of paths, and distance graphs ⋮ Circular chromatic numbers of some distance graphs ⋮ Connectivity and diameter in distance graphs ⋮ Vertex arboricity of integer distance graph \(G(D_{m,k})\) ⋮ Coloring of distance graphs with intervals as distance sets ⋮ Coloring of integer distance graphs ⋮ Distance graphs and \(T\)-coloring
Cites Work
This page was built for publication: Chromatic number of prime distance graphs
