Name
Abstract | ||
|---|---|---|
Given graphs G and H, and a coloring of the edges of G with k colors, a monochromatic H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a monochromatic graph isomorphic to H. Let phi k(n,H) be the smallest number phi such that any graph G of order n and any coloring of its edges with k colors, admits a monochromatic H-decomposition with at most phi parts. Here, we study the function phi k(n,Kr) for k >= 2 and r >= 3. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1002/jgt.21750 | JOURNAL OF GRAPH THEORY |
Keywords | DocType | Volume |
graph decompositions,monochromatic graph decomposiitons | Journal | 76 |
Issue | ISSN | Citations |
2 | 0364-9024 | 1 |
PageRank | References | Authors |
0.37 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Henry Liu | 1 | 3 | 0.87 |
| Teresa Sousa | 2 | 9 | 2.72 |