Name
Abstract | ||
|---|---|---|
Let G be a family of graphs whose edges are colored with elements from a set R of r colors. We assume no two vertices of G are joined by more than one edge of color i for any i@?R, for each G@?G. K\"n^(^r^) will denote the complete graph with r edges joining any pair of distinct vertices, one of each of the r colors. We describe necessary and asymptotically sufficient conditions on n for the existence of a family D of subgraphs of K\"n^(^r^), each of which is an isomorphic copy of some graph in G, so that each edge of K\"n^(^r^) appears in exactly one of the subgraphs in D. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.disc.2007.08.044 | Discrete Mathematics |
Keywords | Field | DocType |
05b20,05b05,05d10,edge-colored,complete graph,decomposition,edge coloring | Discrete mathematics,Complete graph,Graph,Combinatorics,Colored,Vertex (geometry),Graph isomorphism,Decomposition method (constraint satisfaction),Isomorphism,Mathematics | Journal |
Volume | Issue | ISSN |
308 | 14 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anna Draganova | 1 | 2 | 0.74 |
| Yukiyasu Mutoh | 2 | 13 | 2.37 |
| Richard M. Wilson | 3 | 697 | 340.86 |