@article {IOPORT.06077308,
    author       = {Luo, Liang and Liang, Meilian and Li, Zhenchong},
    title        = {Computation of Ramsey numbers $R(C_m,W_n)$.},
    year         = {2012},
    journal      = {JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing},
    volume       = {81},
    issn         = {0835-3026},
    pages        = {145-149},
    publisher    = {Charles Babbage Research Centre, Winnipeg},
    abstract     = {Summary: For given finite simple graphs $F$ and $G$, the Ramsey number $R(F,G)$ is the minimum positive integer $n$ such that for every graph $H$ of order $n$ either $H$ contains $F$ or the complement of $H$ contains $G$. In this note, with the help of computer, we get that $R(C_5,W_6) = 13$, $R(C_5,W_7) = 15$, $R(C_5,W_8) = 17$, $R(C_6,W_6) = 11$, $R(C_6,W_7) = 16$, $R(C_6,W_8) = 13$, $R(C_7,W_6) = 13$ and $R(C_7,W_8) = 17$.},
    identifier   = {06077308},
}