Title of article :
Complete bipartite factorisations by complete bipartite graphs Original Research Article
Author/Authors :
N. Martin، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1997
Pages :
20
From page :
461
To page :
480
Abstract :
We study complete Kp,q-factorisations of Km,n. Simple necessary conditions are found and we conjecture that these conditions are also sufficient. A general construction is given to find infinite families of factorisations proving the conjecture in many cases. The conjecture is proved for Kl,q-factorisations of Kn,n except for q = 4k + 1. The conjecture is also proved for a further family of Kl,3-factorisations.
Journal title :
Discrete Mathematics
Serial Year :
1997
Journal title :
Discrete Mathematics
Record number :
951800
Link To Document :
بازگشت