𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Partitioning complete graphs by heterochromatic trees

✍ Scribed by Ze-min Jin, Xue-liang Li

Book ID
118792885
Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2012
Tongue
English
Weight
194 KB
Volume
28
Category
Article
ISSN
0168-9673

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

Partitioning Complete Bipartite Graphs b
Partitioning Complete Bipartite Graphs by Monochromatic Cycles
✍ P.E. Haxell πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 886 KB

For every positive integer r there exists a constant C r depending only on r such that for every colouring of the edges of the complete bipartite graph K n, n with r colours, there exists a set of at most C r monochromatic cycles whose vertex sets partition the vertex set of K n, n . This answers a

Covering the complete graph by partition
Covering the complete graph by partitions
✍ ZoltΓ‘n FΓΌredi πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 530 KB

A (D, c)-coloring of the complete graph K" is a coloring of the edges with c colors such that all monochromatic connected subgraphs have at most D vertices. Resolvable block designs with c parallel classes and with block size D are natural examples of (D, c)-colorings. However, (D, c)-colorings are