Colouring the real line

DOI10.1016/0095-8956(85)90039-5zbMath0549.05029OpenAlexW2089701624WikidataQ105698031 ScholiaQ105698031MaRDI QIDQ800371

D. K. Skilton, Roger B. Eggleton

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(85)90039-5

zbMATH Keywords

chromatic numberprime numbersinfinite graphsreal numbersdistance setpositive integersfinite subgraphscoloured numbers

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Coloring of graphs and hypergraphs (05C15)

Related Items (57)

Asymptotic clique covering ratios of distance graphs ⋮ The vertex linear arboricity of distance graphs ⋮ Coloring Toeplitz graphs ⋮ Algebraic Distance Graphs and Rigidity ⋮ The chromatic numbers of distance graphs ⋮ Threshold-coloring and unit-cube contact representation of planar graphs ⋮ Connectedness of finite 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 ⋮ Packing chromatic number of distance graphs ⋮ On the density of integral sets with missing differences from sets related to arithmetic progressions ⋮ Chromatic numbers of Cayley graphs of abelian groups: a matrix method ⋮ Distance Graphs Generated by Five Primes (Research) ⋮ On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\) ⋮ Colouring prime distance graphs ⋮ The packing coloring of distance graphs \(D(k,t)\) ⋮ 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. ⋮ Unnamed Item ⋮ Radio labelings of distance graphs ⋮ Bipartite finite Toeplitz graphs ⋮ Prime power and prime product distance graphs ⋮ Circular chromatic numbers of distance graphs with distance sets missing multiples ⋮ Proof of a conjecture on fractional Ramsey numbers ⋮ Fractional chromatic number of distance graphs generated by two-interval sets ⋮ On the chromatic number of Toeplitz graphs ⋮ On finite prime distance graphs ⋮ Distance graphs on \(\mathbb R^n\) with 1-norm ⋮ Connectivity of distance graphs ⋮ Distance graphs with maximum chromatic number ⋮ Powers of cycles, powers of paths, and distance graphs ⋮ On Hamiltonian paths in distance graphs ⋮ Tree coloring of distance graphs with a real interval set ⋮ Vertex-colouring of 3-chromatic circulant graphs ⋮ Invisible runners in finite fields ⋮ Graph colourings and partitions ⋮ Finite-dimensional \(T\)-colorings of graphs ⋮ Circular chromatic numbers of some distance graphs ⋮ Long cycles and paths in distance graphs ⋮ Lonely Runner Polyhedra ⋮ 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})\) ⋮ Weak Unit Disk and Interval Representation of Graphs ⋮ On the chromatic number of circulant graphs ⋮ Coloring of distance graphs with intervals as distance sets ⋮ Distance graphs and the \(T\)-coloring problem ⋮ Coloring of integer distance graphs ⋮ Distance graphs with finite chromatic number ⋮ Distance graphs and \(T\)-coloring ⋮ Sum coloring of distance and circulant graphs

This page was built for publication: Colouring the real line