{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T15:12:16Z","timestamp":1777129936950,"version":"3.51.4"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,6,1]],"date-time":"2006-06-01T00:00:00Z","timestamp":1149120000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2006,6]]},"DOI":"10.1007\/s00373-006-0662-3","type":"journal-article","created":{"date-parts":[[2006,7,5]],"date-time":"2006-07-05T04:06:47Z","timestamp":1152072407000},"page":"261-269","source":"Crossref","is-referenced-by-count":28,"title":["A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph"],"prefix":"10.1007","volume":"22","author":[{"given":"Kazuhiro","family":"Suzuki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"662_CR1","doi-asserted-by":"crossref","unstructured":"Albert, M., Frieze, A., Reed, B.: Multicoloured Hamilton cycles. Electron. J. Comb. 2, \u266fR10 (1995)","DOI":"10.37236\/1204"},{"key":"662_CR2","unstructured":"Alon, N., Brualdi, R.A., Shader, B.L.: Multicolored forests in bipartite decompositions of graphs. J. Comb. Theory Ser. B 53, 143\u2013148 (1991)"},{"key":"662_CR3","unstructured":"Brualdi, R.A., Hollingsworth, S.: Multicolored trees in complete graphs. J. Comb. Theory Ser. B 68, 310\u2013313 (1996)"},{"key":"662_CR4","doi-asserted-by":"crossref","unstructured":"Brualdi, R.A., Hollingsworth, S.: Multicolored forests in complete bipartite graphs. Discrete Math. 240, 239\u2013245 (2001)","DOI":"10.1016\/S0012-365X(00)00159-X"},{"key":"662_CR5","unstructured":"Erd\u00f6s, P., Tuza, Z.: Rainbow Hamiltonian paths and canonically colored subgraphs in infinite complete graphs. Math. Pannonica 1(1), 5\u201313 (1990)"},{"key":"662_CR6","doi-asserted-by":"crossref","unstructured":"Faudree, R.J., Gy\u00e1rf\u00e1s, A., Lesniak, L., Schelp, R.H.: Rainbow coloring the cube. J. Graph Theory 17(5), 607\u2013612 (1993)","DOI":"10.1002\/jgt.3190170507"},{"key":"662_CR7","unstructured":"Fu, H-L., Woolbright, D.E.: On the existence of rainbows in 1-factorizations of K2n. J. Comb. Des. 6, 1\u201320 (1998)"},{"key":"662_CR8","unstructured":"Graham, R.L., Pollak, H.O.: On the addressing problem for loop switching. Bell Syst. Teck. J. 50, 2495\u20132519 (1971)"},{"key":"662_CR9","doi-asserted-by":"crossref","unstructured":"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\u2013110 (1973)","DOI":"10.1007\/BFb0067362"},{"key":"662_CR10","unstructured":"Kaneko, A., Kano, M., Suzuki, K.: Three edge-disjoint Multicolored Spanning Trees in Complete Graphs. preprint (2002)"},{"key":"662_CR11","doi-asserted-by":"crossref","unstructured":"Peck, G.W.: A new proof of a theorem of Graham and Pollak. Discrete Math. 49, 327\u2013328 (1984)","DOI":"10.1016\/0012-365X(84)90174-2"},{"key":"662_CR12","unstructured":"R\u00f6dl, V., Tuza, Z.: Rainbow subgraphs in properly edge-colored graphs. Random Struct. Algorithms 3(2), 175\u2013182 (1992)"},{"key":"662_CR13","unstructured":"Schiermeyer, I.: Rainbow colourings. Not. S. Afr. Math. Soc. 34(1), 51\u201359 (2003)"},{"key":"662_CR14","doi-asserted-by":"crossref","unstructured":"Schiermeyer, I.: Rainbow numbers for matchings and complete graphs. Discrete Math. 286, 157\u2013162 (2004)","DOI":"10.1016\/j.disc.2003.11.057"},{"key":"662_CR15","unstructured":"Shor, P.W.: A lower bound for the length of a partial transversal in a Latin square. J. Comb. Theory Ser. A 33, 1\u20138 (1982)"},{"key":"662_CR16","doi-asserted-by":"crossref","unstructured":"Tverberg, H.: On the decomposition of Kn into complete bipartite graphs. J. Graph Theory 6(4), 493\u2013494 (1982)","DOI":"10.1002\/jgt.3190060414"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-006-0662-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-006-0662-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-006-0662-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,16]],"date-time":"2020-04-16T03:11:30Z","timestamp":1587006690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-006-0662-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,6]]}},"alternative-id":["662"],"URL":"https:\/\/doi.org\/10.1007\/s00373-006-0662-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6]]}}}