The following pages link to Integral distance graphs (Q4351316):
Displaying 24 items.
- On planar Toeplitz graphs (Q367045) (← links)
- On the chromatic number of integral circulant graphs (Q604055) (← links)
- On the independence ratio of distance graphs (Q738864) (← links)
- On Rado's boundedness conjecture (Q817614) (← links)
- Fractional chromatic number of distance graphs generated by two-interval sets (Q942143) (← links)
- \([r,s,t]\)-coloring of trees and bipartite graphs (Q960923) (← links)
- On the chromatic number of circulant graphs (Q1045059) (← links)
- Pattern periodic coloring of distance graphs (Q1127883) (← links)
- Distance graphs and \(T\)-coloring (Q1305534) (← links)
- Coloring planar Toeplitz graphs and the stable set polytope. (Q1422423) (← links)
- Asymptotic clique covering ratios of distance graphs (Q1612760) (← links)
- Circular chromatic numbers of some distance graphs (Q1773363) (← 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)
- Structural properties of Toeplitz graphs (Q2166273) (← links)
- Sequences of integers with three missing separations (Q2297912) (← 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)
- Coloring of distance graphs with intervals as distance sets (Q2567207) (← links)
- Maximal density of sets with missing differences and various coloring parameters of distance graphs (Q2663373) (← links)
- On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\) (Q2698203) (← links)
- Coloring Toeplitz graphs (Q2883614) (← links)
