Colorful isomorphic spanning trees in complete graphs

Annals of Combinatorics

Volumn 9, Issue 2, 2005, Pages 163-167

  Constantine, Gregory M ^a  

^a UNIVERSITY OF PITTSBURGH   (United States)

Author keywords

Colorful matching; Colorful tree; Orthogonal Latin squares

Indexed keywords

EID: 22544434376     PISSN: 02180006     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00026-005-0247-5     Document Type: Article

References (9)

1. D. Banks, G. Constantine, A. Merriwether, and R. LaFrance, Nonparametric inference on mtDNA mismatches, J. Nonparametr. Statist. 11 (1999) 215-232.
2. R.B. Bapat, Mixed discriminants and spanning trees, Sankhyā Ser. A 54 (1992) 49-55.
3. R.B. Bapat and G.M. Constantine, An enumerating function for spanning forests with color restrictions, Linear Algebra Appl. 173 (1992) 231-237.
4. C. Berge, Principles of Combinatorics, Academic Press, New York, 1971.
5. R.C. Bose, S.S. Shrikhande, and E.T. Parker, Further results on the construction of mutually orthogonal Latin squares and the falsity of Euler's conjecture, Canad. J. Math. 12 (1960) 189-203.
6. H. Broersma and X. Li, Spanning trees with many of few colors in edge-colored graphs, Discuss. Math. Graph Theory 17 (2) (1997) 259-269.
7. P.J. Cameron, Parallelisms of complete designs, In: London Math. Soc. Lecture Notes Series, 23, Cambridge Univ. Press, 1976.
8. F. Harari, Parallel concepts in graph theory, Math. Comput. Modelling 18 (7) (1993) 101-105.
9. 2n with a prescribed condition, Discrete Math. 212 (3) (2000) 233-244.