Abstract
Let C be a family of edge-colored graphs. A t-edge colored graph G is (C, t)-saturated if G does not contain any graph in C but the addition of any ed......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
