Heterochromatic matchings in edge-colored graphs

Electronic Journal of Combinatorics

Volumn 15, Issue 1 R, 2008, Pages

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

^a SHANDONG UNIVERSITY   (China)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^c LANZHOU UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 56749158781     PISSN: None     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/862     Document Type: Article

References (19)

1. R. Aharoni, Ryser's conjecture for tri-partite 3-graphs, Combinatorica. 21(1), 2001, 1-4.
2. M. Albert, A. Frieze and B. Reed, Multicolored Hamilton cycles, Electronic J. Combin. 2(1995), Research Paper R10.
3. 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.
4. J. A. Bondy and U.S.R. Murty. Graph Theory with Applications, Macmillan Press[M]. New York, 1976.
5. H.J. Broersma, X.L. Li, G. Woegingerr and S. Zhang, Paths and cycles in colored graphs, Australian J. Combin. 31(2005), 297-309.
6. H. Chen and X.L. Li, Long heterochromatic paths in edge-colored graphs, Electronic J. Combin. 12(1)(2005), Research Paper R33.
7. P. Erdos and Zs. Tuza, Rainbow subgraphs in edge-colorings of complete graphs, Ann. Discrete Math. 55(1993), 81-83.
8. A.M. Frieze and B.A. Reed, Polychromatic Hamilton cycles, Discrete Math. 118 (1993), 69-74.
9. M.R. Garey and D.S. Johnson, Comuters and Intractability, Freeman, New York, 1979, Pages 203. GT55: Multiple Choice Matching Problem.
10. G. Hahn and C. Thomassen, Path and cycle sub-Ramsey numbers and edge-coloring conjecture, Discrete Math. 62(1)(1986), 29-33.
11. P.E. Haxell, A note on a conjecture of Ryser, Periodica Mathemathikai Lapok 30(1995), 73-79.
12. M. Kano, Some Results and Problems on Colored Graphs, Lecture in Nankai University, Nov 25, 2006.
13. E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.
14. H. Li, X.L. Li, G.Z. Liu, and G.H. Wang, The heterochromatic matchings in edge-colored bipartite graphs, to appear in Ars Combinatoria, 2006.
15. H. Li and G.H. Wang, Color degree and heterochromatic matchings in edge-colored bipartite graphs, Utilitas Math, to appear.
16. P.W. Shor, A lower bound for the length of a partial transversal in a latin square, J. Combin. Theory Ser. A 33(1982), 1-8.
17. K. Suzuki, A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph. Graph and Combin, (22),261-269, 2006
18. E. Szemeredi and Zs. Tuza, Upper bound for transversals of tripartite hypergraphs, Period. Math. Hung, 13(1982), 321-323.
19. Zs. Tuza, On the order of vertex sets meeting all edges of a 3-partite hypergraph, Ars Combin, 24(1987), A, 59-63.