Rainbow matchings in properly edge colored graphs

Electronic Journal of Combinatorics

Volumn 18, Issue 1, 2011, Pages

  Wang, Guanghui ^a  

^a SHANDONG UNIVERSITY   (China)

Author keywords

Properly colored graphs; Rainbow matchings; Triangle free graphs

Indexed keywords

EID: 79961232973     PISSN: None     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/649     Document Type: Article

References (11)

1. B. Alspach, Problem 89, Discrete Math. 69 (1988) 106.
2. R.P. Anstee and L. Caccetta, Orthogonal matchings, Discrete Math. 179 (1998) 37-47.
3. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, Macmillan Press, New York, 1976.
4. R.A. Brualdi and H.J. Ryser, Combinatorial Matrix Theory, Cambridge University Press, Cambridge, UK, 1991.
5. H.J. Ryser, Neuere probleme der kombinatorik, Vortrage uber Kombinatorik Ober-wolfach, Mathematisches Forschungsinstitut Oberwolfach, July 1967.
6. T.D. LeSaulnier, C. Stocker, P.S. Wenger and D.B. West, Rainbow Matching in Edge-Colored Graphs, Electron. J. Combin. 17 (2010), #N26.
7. P. Hatami and P.W. Shor, A lower bound for the length of a partial transversal in a Latin square, J. Combin. Theory Ser. A 115 (2008), 1103-1113.
8. M. Kano and X. Li, Monochromatic and heterochromatic subgraphs in edge-colored graphs - a survey, Graphs Combin. 24 (2008), 237-263.
9. S. K. Stein, Transversals of Latin squares and their generalizations, Pacific J. Math. 59 (1975), 567-575.
10. R. Stong, Orthogonal Matchings, Discrete Math. 256 (2002), 515-518.
11. I.M. Wanless, Transversals in Latin squares: A survey, in R. Chapman (ed.), Surveys in Combinatorics 2011, London Math. Soc. Lecture Note Series 392, Cambridge University Press, 2011, pp 403-437.