A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph

Graphs and Combinatorics

Volumn 22, Issue 2, 2006, Pages 261-269

  Suzuki, Kazuhiro ^a  

^a IBARAKI UNIVERSITY   (Japan)

Author keywords

Edge coloring; Heterochromatic; Multicolored; Rainbow; Spanning tree

Indexed keywords

EID: 33745622391     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00373-006-0662-3     Document Type: Article

References (16)

1. Albert, M., Frieze, A., Reed, B.: Multicoloured Hamilton cycles. Electron. J. Comb. 2, #R10 (1995)
2. Alon, N., Brualdi, R.A., Shader, B.L.: Multicolored forests in bipartite decompositions of graphs. J. Comb. Theory Ser. B 53, 143-148 (1991)
3. Brualdi, R.A., Hollingsworth, S.: Multicolored trees in complete graphs. J. Comb. Theory Ser. 868, 310-313 (1996)
4. Brualdi, R.A., Hollingsworth, S.: Multicolored forests in complete bipartite graphs. Discrete Math. 240, 239-245 (2001)
5. Erdös, P., Tuza, Z.: Rainbow Hamiltonian paths and canonically colored subgraphs in infinite complete graphs. Math. Pannonica 1(1), 5-13 (1990)
6. Faudree, R.J., Gyárfás, A., Lesniak, L., Schelp, R.H.: Rainbow coloring the cube. J. Graph Theory 17(5), 607-612 (1993)
7. 2n. J. Comb. Des. 6, 1-20 (1998)
8. Graham, R.L., Pollak, H.O.: On the addressing problem for loop switching. Bell Syst. Teck. 150, 2495-2519 (1971)
9. Graham, R.L., Pollak, H.O.: On embedding graphs in squashed cubes. Lecture Notes in Mathematics, Vol.303, Springer-Verlag, New York/Berlin/ Heidelberg, 99-110 (1973)
10. Kaneko, A., Kano, M., Suzuki, K.: Three edge-disjoint Multicolored Spanning Trees in Complete Graphs, preprint (2002)
11. Peck, G.W.: Anew proof of a theorem of Graham and Pollak. Discrete Math. 49, 327-328 (1984)
12. Rödl, V., Tuza, Z.: Rainbow subgraphs in properly edge-colored graphs. Random Struct. Algorithms 3(2), 175-182 (1992)
13. Schiermeyer, L: Rainbow colourings. Not. S. Afr. Math. Soc. 34(1), 51-59 (2003)
14. Schiermeyer, L: Rainbow numbers for matchings and complete graphs. Discrete Math. 286, 157-162 (2004)
15. Shor, P.W.: A lower bound for the length of a partial transversal in a Latin square. J. Comb. Theory Ser. A 33, 1-8 (1982)
16. n into complete bipartite graphs. J. Graph Theory 6(4), 493-494 (1982)