The chromatic numbers of distance graphs
From MaRDI portal
Publication:1356742
DOI10.1016/S0012-365X(96)00170-7zbMath0879.05027MaRDI QIDQ1356742
Publication date: 12 January 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Asymptotic clique covering ratios of distance graphs, Connectedness of finite distance graphs, Pattern periodic coloring of distance graphs, Coloring planar Toeplitz graphs and the stable set polytope., Circular chromatic numbers of distance graphs with distance sets missing multiples, Distance graphs with maximum chromatic number, Powers of cycles, powers of paths, and distance graphs, On Hamiltonian paths in distance graphs, Circular chromatic numbers of some distance graphs, Long cycles and paths in distance graphs, On the independence ratio of distance graphs, Connectivity and diameter in distance graphs, On the chromatic number of circulant graphs, Coloring of distance graphs with intervals as distance sets, Minimum chromaticity of circulant graphs, Distance graphs and \(T\)-coloring, Sum coloring of distance and circulant graphs, A lack-of-fit test for quantile regression process models
Cites Work
