𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Heterochromatic tree partition number in complete multipartite graphs

✍ Scribed by Zemin Jin, Peipei Zhu

Book ID
120694216
Publisher
Springer US
Year
2012
Tongue
English
Weight
267 KB
Volume
28
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Partitioning complete multipartite graph
Partitioning complete multipartite graphs by monochromatic trees
✍ Atsushi Kaneko; M. Kano; Kazuhiro Suzuki πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 102 KB

The tree partition number of an r-edge-colored graph G, denoted by t r (G), is the minimum number k such that whenever the edges of G are colored with r colors, the vertices of G can be covered by at most k vertex-disjoint monochromatic trees. We determine t 2 (K (n 1 ; n 2 ; . . . ; n k )) of the c

Multipartite Graph-Tree Ramsey Numbers
Multipartite Graph-Tree Ramsey Numbers
✍ PAUL ERDΓ–S; R. J. FAUDREE; C. C. ROUSSEAU; R. H. SCHELP πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 449 KB