Cargando…
Monochromatic Clique Decompositions of Graphs
Let G be a graph whose edges are colored with k colors, and [Formula: see text] be a k‐tuple of graphs. A monochromatic [Formula: see text] ‐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 copy of [Formula: see text] in colo...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
John Wiley and Sons Inc.
2015
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5445619/ https://www.ncbi.nlm.nih.gov/pubmed/28615799 http://dx.doi.org/10.1002/jgt.21851 |