Abstract
Given a graph G and a positive integer k, define the Gallai-Ramsey number to be the minimum number of vertices n such that any edge-coloring of Kn usi......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
