Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey

Graphs and Combinatorics

Volumn 24, Issue 4, 2008, Pages 237-263

  Kano, Mikio ^a   Li, Xueliang ^b  

^a IBARAKI UNIVERSITY   (Japan)

^b NANKAI UNIVERSITY   (China)

Author keywords

Cycle; Edge colored graph; Heterochromatic; Monochromatic; Path, tree; Vertex partition

Indexed keywords

EID: 51849141446     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00373-008-0789-5     Document Type: Review

References (80)

1. Akbari, S., Alipour, A.: Multicolored trees in complete graphs. J. Graph Theory 54, 221-232 (2006)
2. Aldred, R.E.L., Wormald, N.C.: More on the linear k-arboricity of regular graphs. Australas. J. Combin. 18, 97-104 (1998)
3. Akiyama, J., Exoo, G., Harary, F.: Covering and packing in graphs III, Cyclic and acyclic invariants. Math. Slovaca 30, 405-417 (1980)
4. Albert, M., Frieze, A., Reed, B.: Multicoloured Hamilton cycles, Electronic J. Combin. 2, #R10 (1995)
5. Alexeev, B.: On lengths of rainbow cycles. Electron. J. Combin. 13, #R105 (2006)
6. Alon, N., Brualdi, R.A., Shader, B.L.: Multicolored forests in bipartite decompositions of graphs. J. Combin. Theory, Ser. B 53, 143-148 (1991)
7. Alon, N., Gutin, G.: Properly colored Hamiltonian cycles in edge-colored complete graphs. Random Structures Algorithms 11, 179-186 (1997)
8. Alon, N., Jiang, T., Miller, Z., Pritikin, D.: Properly colored subgraphs and rainbow subgraphs in edge colorings with local constraints. Random Structures Algorithms 23 (4), 409-433 (2003)
9. Axenovich, M., Jiang, T., Tuza, Zs.: Local anti-Ramsey numbers of graphs. Combin. Probab. Comput. 12 (5-6), 495-511 (2003)
10. Ayel, J.: "Sur l'existence de deux cycles supplémuntaires unicolorés disjoints et de couleurs différentes dans un graphe complet bicolore," Thesis, University of Grenoble, 1979
11. Bermond, J.C., Fouquent, J.L., Habibi, M., Ṕeroche, B.: On linear k-arboricity. Diserte Math. 52, 123-132 (1984)
12. Bialostocki, A., Voxman, W.: On monochromatic-rainbow generalizations of two Ramsey type theorems. Ars Combin. 68, 131-142 (2003)
13. Bierbrauer, J., Dierker, P.: Monochromatic connected subgraphs in a multicoloring of the complete graph, Preprint
14. Bollobás, B., Erdos, P.: Alternating Hamiltonian cycles. Isr. J. Math. 23, 126-131 (1976)
15. Broersma, H.J., Li, X.: Spanning trees with many or lew colors in edge-colored graphs. Discuss. Math. Graph Theory 17, 259-269 (1997)
16. Broersma, H.J., Li, X., Woeginger, G., Zhang, S.: Paths and cycles in colored graphs. Australasian J. Combin. 31, 297-309 (2005)
17. Brualdi, R.A., Hollingsworth, S.: Multicolored trees in complete graphs. J. Combin. Theory, Ser. B 68, 310-313 (1996)
18. Brualdi, R.A., Hollingsworth, S.: Multicolored forests in complete bipartite graphs. Disrete Math. 240, 239-245 (2001)
19. Chang, R.S., Leu, S.J.: The minimum labelling spanning trees. Inform. Process. Lett. 63, 277-282 (1997)
20. Chartrand, G., Lesniak, L.: Graphs and Combinatorics (third edition). Chapman & Hall, New York (1996)
21. Chen, H., Jin, Z.M., Li, X., Tu, J.H.: Heterochromatic tree partition numbers for complete bipartite graphs. Discrete Math., in press, doi: 10.1016/j.disc.2007.07.085
22. Chen. H., Li, X.: Long heterochromatic paths in edge-colored graphs. Electron. J. Combin. 12, #R33 (2005)
23. Chen, H., Li, X.: Color degree and color neighborhood union conditions for long heterochromatic paths in edge-colored graphs. arXiv:math.CO/0512144 v17 Dec 2005
24. Chen, H., Li, X.: Color neighborhood union conditions for long heterochromatic paths in edge-colored graphs. Electron. J. Combin. 14, #R77 (2007)
25. Chou, W.S., Manoussakis, Y., Megalalaki, O., Spyratos, M., Tuza, Zs.: Paths through fixed vertices in edge-colored graphs. Math. Inf. Sci. Hun. 32, 49-58 (1994)
26. Constantine, G.M.: Colorful isomorphic spanning trees in complete graphs. Ann. Combin. 9, 163-167 (2005)
27. Cooper, C., Frieze, A.: Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold. Electron. J. Combin. 2, J3R19 (1995)
28. Denes, J., Keedwell, A.D.: Latin Squres: New Developments in the Theory and Applications. Ann. Discrete Math. 46, North-Holland, New York, 1991
29. (r). J. Combin. Des., preprint
30. Erdos, P., Galvin, F.: Monochromatic infinite paths. Discrete Math. 113, 59-70 (1993)
31. Erdos, P., Gallai, T.: On maximal paths and circuits of graphs. Acta. Math. Acad. Sc. Hungar. 10, 337-356 (1959)
32. Erdos, P., Gyárfás, A., Pyber, L.: Vertex coverings by monochromatic cycles and trees. J. Combin. Theory Ser. B 51, 90-95 (1991)
33. Erdos, P., Nesetril, J., Rödl, V.: Some problems related to partitions of edges of a graph. Graphs and Other Combinatorial Topics, Teubner, Leipzig, 54-63 (1983)
34. Erdos, P., Tuza, Zs.: Rainbow Hamiltonian paths and canonically colored subgraphs in infinite complete graphs. Math. Pannon 1(1), 5-13 (1990)
35. Frieze, A., Reed, B.: Polychromatic Hamilton cycles. Discrete Math. 118, 69-74 (1993)
36. Füredi, Z.: Maximum degree and fractional matchings in uniform hypergraphs. Combinatorica 1, 155-162 (1981)
37. Füredi, Z.: Matchings and covers in hypergraphs. Graphs Combin. 4, 115-206 (1988)
38. Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman, San Francisco, 1979
39. Gerencsér, L., Gyárfás, A.: On Ramsey-type problems, Ann. Univ. Sci. Bud. de Rol. Eötvös Sect. Math. 10, 167-170 (1967)
40. Gyárfás, A.: Partition coverings and blocking sets in hypergraphs (in Hungarian). Tanulmányok-MTA Számitástechn. Automat. Kutató Int. Budapest 71, 62 pp. (1977)
41. Gyárfás, A.: Vertex coverings by monochromatic paths and cycles. J. Graph Theory 7, 131-135 (1983)
42. Gyárfás, A.: Covering complete graphs by monochromatic paths, in Irregularities of Partitions, Algorithms and Combinatorics, Springer-Verlag 8, 89-91 (1989)
43. Gyárfás, A., Jagota, A., Schelp, R.H.: Monochromatic path covers in nearly complete graphs. J. Combin. Math. Combin. Comput. 25, 129-144 (1997)
44. Gyárfás, A., Ruszinkó, M., Särközy, G.N., Szemerédi, E.: An improved bound for the monochromatic cycle partition number. J. Combin. Theory Ser. B 96, 855-873 (2006)
45. Gyárfás, A., Simonyi, G.: Edge colorings of complete graphs without tricolored triangles. J. Graph Theory 46, 211-216 (2004)
46. Hahn. G., Thomassen, C.: Path and cycle sub-Ramsey numbers and an edge coloring conjecture. Discrete Math. 62, 29-33 (1986)
47. Hajnal, A., Komjáth, P., Soukup, L., Szalkai, I.: Decompositions of edge-colored infinite complete graphs. Colloq. Math. Soc. János Bolyai 52, 277-280 (1987)
48. Haxell, P.E., Kohayakawa. Y.: Partitioning by monochromatic trees. J. Combin. Theory, Ser. B 68, 218-222 (1996)
49. Haxell, P.E.: Partititoning complete bipartite graphs by monochromatic cycles. J. Combin. Theory, Ser. B 69, 210-218 (1997)
50. Hu, L., Li, X.: Sufficient conditions for the existence of perfect heterochromatic matchings in colored graphs. Discrete Geometry, Combinatorics and Graph Theory, 7th China-Japan Conference, CJCDGCGT 2005, Lecture Notes in Computer Science, Vol. 4381, 2007
51. Jiang, T., West, D.B.: Edge colorings of complete graphs that avoid polychromatic trees. Discrete Math. 274, 137-145 (2005)
52. Jin, Z.M., Kano, M., Li, X., Wei, B.: Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees. J. Comb. Optim. 11, 445-454 (2006)
53. Jin, Z.M., Li, X.: The complexity for partitioning graphs by monochromatic trees, cycles and paths. Int. J. Comput. Math. 81, 1357-1362 (2004)
54. Jin, Z.M., Li, X.: Vertex partitions of r-edge-colored graphs. Appl. Math. J. Chinese Univ. Ser. B. 23(1), 120-126 (2008)
55. Jin, Z.M., Li, X.: Spanning trees with many colors in edge-colored graphs. J. Xinjiang University 23(Supp.), 12-14 (2006)
56. Jin, Z.M., Li, X.: Partitioning complete graphs by rainbow trees, arXiv:0711.2849 [math.CO] 19 Nov 2007
57. Kaneko, A., Kano, M., Suzuki, K.: Three edge disjoint multicolored spanning trees in complete graphs, Preprint 2003
58. Kaneko, A., Kano, M., Suzuki, K.: Partitioning complete multipartite graphs by monochromatic trees. J. Graph Theory 48, 133-141 (2005)
59. Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Holt, Tinehart and Winston, New York, 1976
60. Li, H.: A generalization of Gallai-Roy theorem. Graphs Combin. 17, 681-685 (2001)
61. Li, H., Li, X., Liu, G., Wang, G.: The heterochromatic matchings in edge-colored bipartite graphs. Ars Combin., in press
62. Li, H., Wang, G.: Color degree and heterochromatic matchings in edge-colored bipartite graphs. Utilitas Math., to appear
63. (r). arXiv:0711.2847 [math.CO] 19 Nov 2007
64. Li, X., Zhang, X.Y.: On the minimum monochromatic or multicolored subgraph partition problems. Theoretical Computer Science 385, 1-10 (2007)
65. Li, X., Zheng, J.: Monochromatic and heterochromatic subgraphs problems in a randomly colored graph, Preprint 2005 (arXiv:0711.3827 [math.CO] 24 Nov 2007)
66. Luczak, T., Rödl, V., Szemerédi, E.: Partitioning two-coloured complete graphs into two monochromatic cycles. Probab. Combin. Comput. 7, 423-436 (1998)
67. Manoussakis, Y., Spyratos. M., Tuza, Zs.: Cycles of given color paterns. J. Graph Theory 21(2), 153-162 (1996)
68. Montellano-Ballesteros, J.J.: An anti-Ramsey theorem on edge-cuts. Discuss. Math. Graph Theory 26, 19-21 (2006)
69. Pyber, L., Rödl, V., Szemerédi, E.: Dense graphs without 3-regular subgraphs. J. Combin. Theory, Ser. B 63, 41-54 (1995)
70. Rado, R.: Monochromatic paths in graphs. Ann. Discrete Math. 3, 197-194 (1978)
71. Rödl, V., Tuza, Zs.: Rainbow subgraphs in properly edge-colored graphs. Random Structures Algorithms 3, 175-182 (1992)
72. Ryser, H.J.: Neuere probleme der kombinatorik, In: "Vortrage uber Kombinatorik Oberwolfach", Mathematiches Forschungsinstitut Oberwolfach, pp 24-29, Juli 1967
73. Sárközy, G.N., Selkow, S.M.: Vertex partitions by connected monochromatic k-regular graphs. J. Combin. Theory, Ser. B 78, 115-122 (2000)
74. Stein, S.K.: Transversals of Latin squares and their generalizations. Pacific J. Math. 59(2), 567-575 (1975)
75. Suzuki, K.: A necessary and sufficient contidion for the existence of a heterochromatic spanning tree in a graph. Graphs Combin. 22, 261-269 (2006)
76. Thomassen, C.: Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5. J. Combin. Theory, Ser. B 75, 100-109 (1999)
77. Tuza, Zs.: Some special cases of Rysers Conjecture, Preprint (1978)
78. Hans-Christoph W., Multicriteria approximation of network design and network upgrade problems, Chapter 2, Ph.D. Dissertation, Bayerischen Julius-Maximilians Universität, Wüzburg, March 2001
79. 2n. J. Combin. Des. 6, 1-20 (1998)
80. Yuster, R.: Rainbow H-factors. Electron. J. Combin. 13, #R13 (2006)