Abstract
An H-decomposition of a graph G is a partition P of E(G) into blocks, each element of which induces a copy of H. An (s, p)-equitable block-coloring of......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
