A combinatorial approach to the orthogon
โ
J.A. Dias da Silva; Maria M. Torres
๐
Article
๐
2006
๐
Elsevier Science
๐
English
โ 199 KB
Let G = (X, Y, E) be a bipartite multigraph. Let ยต = (ยต 1 , . . . , ยต s ) be a partition of |E|. A ยต-coloring for G is a proper edge coloring (U 1 , . . . , U s ), such that |U i | = ยต i , i = 1, . . . , s. Let ฯ X be the partition of |E| whose terms are the degrees of the vertices of X arranged in