Abstract
We apply Ramsey theoretic tools to show that there is a family of graphs which have tree-chromatic number at most 2 while the path-chromatic number is......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
