The following pages link to Colouring the real line (Q800371):
Displaying 50 items.
- Threshold-coloring and unit-cube contact representation of planar graphs (Q344821) (← links)
- Finite prime distance graphs and 2-odd graphs (Q390314) (← links)
- Packing chromatic number of distance graphs (Q412353) (← links)
- On the chromatic number of Toeplitz graphs (Q496679) (← links)
- Powers of cycles, powers of paths, and distance graphs (Q531605) (← links)
- On Hamiltonian paths in distance graphs (Q533446) (← links)
- On the density of integral sets with missing differences from sets related to arithmetic progressions (Q627623) (← links)
- Long cycles and paths in distance graphs (Q712275) (← links)
- On the independence ratio of distance graphs (Q738864) (← links)
- The vertex linear arboricity of distance graphs (Q819822) (← links)
- Colouring prime distance graphs (Q912118) (← links)
- Fractional chromatic number of distance graphs generated by two-interval sets (Q942143) (← links)
- Invisible runners in finite fields (Q975401) (← links)
- Vertex arboricity of integer distance graph \(G(D_{m,k})\) (Q1024482) (← links)
- On the chromatic number of circulant graphs (Q1045059) (← links)
- Pattern periodic coloring of distance graphs (Q1127883) (← links)
- Connectivity of distance graphs (Q1196753) (← links)
- Distance graphs and the \(T\)-coloring problem (Q1297406) (← links)
- Distance graphs and \(T\)-coloring (Q1305534) (← links)
- The chromatic numbers of distance graphs (Q1356742) (← links)
- Coloring planar Toeplitz graphs and the stable set polytope. (Q1422423) (← links)
- Coloring of integer distance graphs (Q1584411) (← links)
- Asymptotic clique covering ratios of distance graphs (Q1612760) (← links)
- Prime power and prime product distance graphs (Q1727759) (← links)
- Circular chromatic numbers of some distance graphs (Q1773363) (← links)
- Distance graphs with finite chromatic number (Q1850605) (← links)
- Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) (Q1956238) (← links)
- Circular chromatic numbers of distance graphs with distance sets missing multiples (Q1971805) (← links)
- Vertex-colouring of 3-chromatic circulant graphs (Q2012064) (← links)
- On finite prime distance graphs (Q2241660) (← links)
- Sequences of integers with three missing separations (Q2297912) (← links)
- The packing coloring of distance graphs \(D(k,t)\) (Q2440104) (← links)
- On packing colorings of distance graphs (Q2440126) (← links)
- Radio labelings of distance graphs (Q2446877) (← links)
- Bipartite finite Toeplitz graphs (Q2448907) (← links)
- Distance graphs on \(\mathbb R^n\) with 1-norm (Q2471053) (← links)
- Distance graphs with maximum chromatic number (Q2476275) (← links)
- Tree coloring of distance graphs with a real interval set (Q2481438) (← links)
- Coloring of distance graphs with intervals as distance sets (Q2567207) (← links)
- On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\) (Q2698203) (← links)
- Weak Unit Disk and Interval Representation of Graphs (Q2827814) (← links)
- Coloring Toeplitz graphs (Q2883614) (← links)
- Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$ (Q2946061) (← links)
- Connectivity and diameter in distance graphs (Q3087615) (← links)
- (Q3390431) (← links)
- Sum coloring of distance and circulant graphs (Q3439341) (← links)
- Proof of a conjecture on fractional Ramsey numbers (Q3553231) (← links)
- Algebraic Distance Graphs and Rigidity (Q4712768) (← links)
- Distance Graphs Generated by Five Primes (Research) (Q5118660) (← links)
- Connectedness of finite distance graphs (Q5326769) (← links)
