Abstract
Let ar(G, H) be the largest number of colors such that there exists an edge coloring of G with ar(G, H) colors such that each subgraph isomorphic to H......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
