Color degree and heterochromatic cycles in edge-colored graphs

European Journal of Combinatorics

Volumn 33, Issue 8, 2012, Pages 1958-1964

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

^a CNRS   (France)

^b LANZHOU UNIVERSITY   (China)

^c SHANDONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84863490483     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2012.06.005     Document Type: Article

References (17)

1. Albert M., Frieze A., Reed B. Multicolored Hamilton cycles. Electronic Journal of Combinatorics 1995, 2. Research Paper R10.
2. Alon N., Jiang T., Miller Z., Pritikin D. Properly colored subgraphs and rainbow subgraphs in edge-colored graphs with local constraints. Random Structures and Algorithms 2003, 23(4):409-433.
3. Bondy J.A. Counting subgraphs: a new approach to the Caccetta-Häggkvist conjecture. Discrete Mathematics 1997, 165-166:71-80.
4. Bondy J.A., Murty U.S.R. Graph Theory with Applications 1976, Macmillan Press, New York.
5. Broersma H.J., Li X., Woeginger G., Zhang S. Paths and cycles in colored graphs. Australasian Journal of Combinatorics 2005, 31:297-309.
6. L. Caccetta, R. Häggkvist, On minimal digraphs with given girth, in: Proceedings, Ninth S-E Conference on Combinatorics, Graph Theory and Computing, 1978, pp. 181-187.
7. Chen H., Li X. Long heterochromatic paths in edge-colored graphs. Electronic Journal of Combinatorics 2005, 12(1):R33. Research Paper.
8. Erdos P., Nešetřil J., Rödl V. Some problems related to partitions of edges of a graph. Graphs and Other Combinatorial Topics 1983, 54-63. Teubner, Leipzig.
9. Erdos P., Tuza Zs. Rainbow subgraphs in edge-colorings of complete graphs. Annals of Discrete Mathematics 1993, 55:81-83.
10. Frieze A.M., Reed B.A. Polychromatic Hamilton cycles. Discrete Mathematics 1993, 118:69-74.
11. Hahn G., Thomassen C. Path and cycle sub-Ramsey numbers and edge-coloring conjecture. Discrete Mathematics 1986, 62(1):29-33.
12. Li H., Li X., Liu G., Wang G. The heterochromatic matchings in edge-colored bipartite graphs. Ars Combinatoria 2009, 93:129-139.
13. Li H., Wang G. Color degree and heterochromatic matchings in edge-colored bipartite graphs. Utilitas Mathematica 2008, 77:145-154.
14. Shen J. Directed triangles in digraphs. Journal of Combinatorial Theory. Series B 1998, 74:405-407.
15. Shor P.W. A lower bound for the length of a partial transversal in a Latin square. Journal of Combinatorial Theory. Series A 1982, 33:1-8.
16. Suzuki K. A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph. Graphs and Combinatorics 2006, 22:261-269.
17. G. Wang, H. Li, G. Liu, Y. Zhu, A note on heterochromatic C4 in edge-colored triangle-free graphs, Graphs and Combinatorics (2011) http://dx.doi.org/10.1007/s00373-011-1087-1.