Colouring prime distance graphs
From MaRDI portal
Publication:912118
DOI10.1007/BF01787476zbMath0698.05033OpenAlexW2011433190WikidataQ105698033 ScholiaQ105698033MaRDI QIDQ912118
D. K. Skilton, Roger B. Eggleton
Publication date: 1990
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01787476
Related Items (34)
Asymptotic clique covering ratios of distance graphs ⋮ The vertex linear arboricity of distance graphs ⋮ Chromatic number of prime distance graphs ⋮ The chromatic numbers 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 ⋮ Coloring distance graphs on the plane ⋮ Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs ⋮ Chromatic coloring of distance graphs, III ⋮ Distance Graphs Generated by Five Primes (Research) ⋮ On packing colorings of distance graphs ⋮ Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) ⋮ Coloring planar Toeplitz graphs and the stable set polytope. ⋮ 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 ⋮ On finite prime distance graphs ⋮ Distance graphs on \(\mathbb R^n\) with 1-norm ⋮ Distance graphs with maximum chromatic number ⋮ On uniquely \(k\)-determined permutations ⋮ Powers of cycles, powers of paths, and distance graphs ⋮ On Hamiltonian paths in distance graphs ⋮ Invisible runners in finite fields ⋮ Graph colourings and partitions ⋮ 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 ⋮ Coloring of integer distance graphs ⋮ Distance graphs and \(T\)-coloring
Cites Work
This page was built for publication: Colouring prime distance graphs