Multicolored forests in complete bipartite graphs

Discrete Mathematics

Volumn 240, Issue 1-3, 2001, Pages 239-245

  Brualdi, Richard A ^a   Hollingsworth, Susan ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

Complete bipartite graph; Majorization; Multicolored subgraphs; Trees

Indexed keywords

EID: 0035964590     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00159-X     Document Type: Article

References (4)

1. N. Alon, R.A. Brualdi, B.L. Shader, Multicolored forests in bipartite decompositions of graphs, J. Combin. Theory, Ser. B 53 (1991) 143-148.
2. R.A. Brualdi, S. Hollingsworth, Multicolored trees in complete graphs, J. Combin. Theory, Ser. B 68 (1996) 310-313.
3. R. Rado, A theorem on independence relations, Quart. J. Math. Oxford Ser. 13 (1942) 83-89.
4. H.J. Ryser, Combinatorial Mathematics, Carus Mathematical Monographs, No. 14, Mathematical Association of America, Washington, DC, 1963, pp. 61-65.