Cover-Decomposition and polychromatic numbers
A colouring of a hypergraph's vertices is polychromatic if every hyperedge contains at least one vertex of each colour; the polychromatic number is the maximum number of colours in such a colouring. Its dual, the cover-decomposition number, is the maximum number of disjoint hyperedge-covers. In...
| Hlavní autoři: | , , , |
|---|---|
| Médium: | Journal article |
| Jazyk: | English |
| Vydáno: |
2011
|