Color degree and heterochromatic matchings in edge-colored bipartite graphs

Utilitas Mathematica

Volumn 77, Issue , 2008, Pages 145-154

  Li, Hao ^a,b   Wang, Guanghui ^a,c  

^a CNRS   (France)

^b LANZHOU UNIVERSITY   (China)

^c SHANDONG UNIVERSITY   (China)

Author keywords

Algorithm; Color degree; Color neighborhood; Heterochromatic matching

Indexed keywords

EID: 57049097631     PISSN: 03153681     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. M. Albert, A. Frieze and B. Reed, Multicolored Hamilton cycles, Electronic J. Combin. 2(1995), Research Paper R10.
2. N. Alon, T. Jiang, Z. Miller and D. Pritikin, Properly colored subgraphs and rainbow subgraphs in edge-colored graphs with local constraints, Random Struct. Algorithms 23(2003), No.4,409-433.
3. J.A. Bondy and U.S.R. Murty. Graph Theory with Applications, Macmillan Press[M]. New York, 1976.
4. H.J. Broersma, X. Li, G. Woegingerr and S. Zhang, Paths and cycles in colored graphs, Australian J. Combin. 31(2005), 297-309.
5. H. Chen and X. Li, Long heterochromatic paths in edge-colored graphs, The Electronic J. Combin. 12(1)(2005), Research Paper R33.
6. P. Erdös and Zs. Tuza, R.ainbow subgraphs in edge-colorings of complete graphs, Ann. Discrete Math. 55(1993), 81-83.
7. A.M. Frieze and B.A. Reed, Polychromatic Hamilton cycles, Discrete Math. 118 (1993), 69-74.
8. M.R. Garey and D.S. Johnson, Comuters and Intractability, Freeman, New York, 1979, Pages 203. GT55: Multiple Choice Matching Problem.
9. G. Hahn and C. Thomassen, Path and cycle sub-Ramsey numbers and edge-coloring conjecture, Discrete Math. 62(1)(1986), 29-33.
10. P. Hall, On representatives of subsets, J. London Math. Soc., 10(1935), 26-30.
11. L. Hu, H. Li and X. Li, Best lower bound for the maximum heterochromatic matchings in edge-colored bipartite graphs, arXiv:math.CO/0512653, 10 Jan. 2006.
12. L. Hu and X. Li, Sufficient conditions for the existence of perfect heterochromatic matcings in colored graphs, arXiv:math.Co/051160v1 24Nov 2005.
13. E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.
14. H. Li, X. Li, G. Liu, and G. Wang, The heterochromatic matchings in edge-colored bipartite graphs, to appear in Ars Combinatoria.
15. H. Li and G. Wang, Color neighborhood and heterochromatic matchings in edge-colored bipartite graphs, RR L.R.I NO(2006)1443.