The following pages link to Colouring the real line (Q800371):
Displayed 24 items.
- 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)
- 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)
- Circular chromatic numbers of some distance graphs (Q1773363) (← links)
- Distance graphs with finite chromatic number (Q1850605) (← links)
- Circular chromatic numbers of distance graphs with distance sets missing multiples (Q1971805) (← 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)
- Sum coloring of distance and circulant graphs (Q3439341) (← links)
- Algebraic Distance Graphs and Rigidity (Q4712768) (← links)
- Graph colourings and partitions (Q5941502) (← links)
- Finite-dimensional \(T\)-colorings of graphs (Q5941520) (← links)