Abstract
Given a graph H, the k-colored Gallai-Ramsey number grk(K3 :H) is defined to be the minimum integer n such that every k-coloring (using all k colors) ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
