A refinement of Cayley's formula for trees.
Gessel, Ira M., Seo, Seunghyun (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gessel, Ira M., Seo, Seunghyun (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cho, Manwon, Kim, Dongsu, Seo, Seunghyun, Shin, Heesung (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Zoran Stanić (2006)
Publications de l'Institut Mathématique
Similarity:
Chen, William Y.C., Yan, Sherry H.F. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Mészáros, Karola (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hough, David S. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bernardi, Olivier (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Lily Chen, Xueliang Li, Kang Yang, Yan Zhao (2015)
Discussiones Mathematicae Graph Theory
Similarity:
Let G be a nontrivial connected graph with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ ℕ, where adjacent edges may be colored the same. A tree T in G is a rainbow tree if no two edges of T receive the same color. For a vertex subset S ⊆ V (G), a tree that connects S in G is called an S-tree. The minimum number of colors that are needed in an edge-coloring of G such that there is a rainbow S-tree for each k-subset S of V (G) is called the k-rainbow index of G, denoted by rxk(G)....
Schaeffer, Gilles (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Seo, Seunghyun (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ku, Cheng Yeaw, Wong, K.B. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Picollelli, Michael E. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity: