Note about the upper chromatic number of mixed hypertrees
A mixed hypergraph is a triple H=(X,C,D), where X is the vertex set and each of C,D is a family of subsets of X, the C-edges and D-edges, respectively. A proper k-coloring of H is a mapping c:→[k] such that each C-edge has two vertices with a common color and each D-edge has two vertices with distin...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2005-10-01
|
| Series: | Computer Science Journal of Moldova |
| Online Access: | http://www.math.md/files/csjm/v13-n2/v13-n2-(pp131-135).pdf |