  This brief note gives several new upper and lower bounds on Ramsey numbers
for books and wheels, including tight lower bounds establishing the Ramsey
numbers $R(B_3, B_6) = 19$, $R(B_4,B_5)=19$, $R(B_5,B_6)= 23$, and $R(B_6,B_7)=
27$, and tight upper and lower bounds establishing $R(W_5, W_7) = 15$. The new
upper bound was obtained using the flag algebra method, and the lower bounds
come from constructions discovered using tabu search.
  We also explore generalized Ramsey numbers using similar methods. Let
$GR(r,K_s,t)$ denote the minimum number of vertices $n$ such that any
$r$-edge-coloring of $K_n$ has a copy of $K_s$ with at most $t$ colors. We
establish $GR(3,K_4,2) = 10$, $GR(4,K_4,3) = 10$, and some additional bounds.
