Heterochromatic tree partition numbers for complete bipartite graphs

Discrete Mathematics

Volumn 308, Issue 17, 2008, Pages 3871-3878

  Chen, He ^a   Jin, Zemin ^b   Li, Xueliang ^a   Tu, Jianhua ^a  

^a NANKAI UNIVERSITY   (China)

^b ZHEJIANG NORMAL UNIVERSITY   (China)

Author keywords

Complete bipartite graph; Edge coloring; Heterochromatic tree; Partition number

Indexed keywords

INTEGER PROGRAMMING; NUMBER THEORY; NUMERICAL METHODS; PROBLEM SOLVING;

COMPLETE BIPARTITE GRAPH; EDGE-COLORING; HETEROCHROMATIC TREE; PARTITION NUMBER;

TREES (MATHEMATICS);

EID: 44149125285     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2007.07.085     Document Type: Article

References (8)

1. Erdös P., and Gyárfás A. Split and balanced colorings of complete graphs. Discrete Math. 200 (1999) 79-86
2. Erdös P., Gyárfás A., and Pyber L. Vertex coverings by monochromatic cycles and trees. J. Combin. Theory Ser. B 51 (1991) 90-95
3. Gyárfás A. Vertex coverings by monochromatic paths and cycles. J. Graph Theory 7 (1983) 131-135
4. Haxell P.E. Partitioning complete bipartite graphs by monochromatic cycles. J. Combin. Theory Ser. B 69 (1997) 210-218
5. Haxell P.E., and Kohayakawa Y. Partitioning by monochromatic trees. J. Combin. Theory Ser. B 68 (1996) 218-222
6. Kaneko A., Kano M., and Suzuki K. Partitioning complete multipartite graphs by monochromatic trees. J. Graph Theory 48 (2005) 133-141
7. Luczak T., Rödl V., and Szemerédi E. Partitioning 2-edge-colored complete graphs into 2 monochromatic cycles. Combin. Probab. Comput. 7 (1998) 423-436
8. Rado R. Monochromatic paths in graphs. Ann. Discrete Math. 3 (1978) 191-194