摘要
An isomorphic fatorisation of a graph G=（V, E） is a partition {E1, E2, …Et} of the edge set E such that the subgraphs （V, E1）, （V, E2）, …（V, E1） are all isomorphic to each other. If there exists an isomorphic factorisation which divides graph G into t isomorphic subgraphs, we say G is divisible by t and write t|G. Obviously, a necessary condition for t|G is that t||E（G）|. This is called the divisibility condition for G and t. Harary et al, showed that whenever t=2 or 4, the divisibility condition is sufficient for t|K（m,n,8）. They conjecture
