Abstract
An edge-colored graph is called rainbow if all the colors on its edges are distinct. Given a positive integer n and a graph G, the anti-Ramsey number ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
