Large rainbow matchings in edge-coloured graphs

Combinatorics Probability and Computing

Volumn 21, Issue 1-2, 2012, Pages 255-263

  Kostochka, Alexandr ^a,b   Yancey, Matthew ^b  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLETE GRAPHS; MATCHINGS; SUBGRAPHS; SUFFICIENT CONDITIONS;

COLOR;

GRAPH THEORY;

EID: 84859317959     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548311000605     Document Type: Article

References (5)

1. Kano, M. and Li, X. (2008) Monochromatic and heterochromatic subgraphs in edge-colored graphs: A survey. Graphs Combin. 24 237-263.
2. LeSaulnier, T. D., Stocker, C., Wegner, P. S. and West, D. B. (2010) Rainbow matching in edge-colored graphs. Electron. J. Combin. 17 N26.
3. Li, H. and Wang, G. (2008) Color degree and heterochromatic matchings in edge-colored bipartite graphs. Util. Math. 77 145-154.
4. Li, X. and Xu, Z. (2007) On the existence of a rainbow 1-factor in proper coloring of K(r) rn . arXiv:0711.2847 [math.CO].
5. Wang, G. and Li, H. (2008) Heterochromatic matchings in edge-colored graphs. Electron. J. Combin. 15 R138.