Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
38 0 |
SM ISO690:2012 NICULITSA, Angela, VOSS, Heinz-Jurgen. A characterization of uniquely colorable mixed hypergraphs of order n with upper chromatic numbers n - 1 and n - 2. In: Australasian Journal of Combinatorics, 2000, vol. 21, pp. 167-177. ISSN 1034-4942. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Australasian Journal of Combinatorics | ||||||
Volumul 21 / 2000 / ISSN 1034-4942 /ISSNe 2202-3518 | ||||||
|
||||||
Pag. 167-177 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
A mixed hypergraph consists of two families of subsets of the vertex set: the V-edges and the C-edges. In a suitable coloring of a mixed hypergraph, every C-edge has at least two vertices of the same color, and every D-edge has at least two vertices colored differently. The largest and smallest possible numbers of colors in a coloring are called the upper and lower chromatic numbers, χ and χ, respectively. A mixed hypergraph is uniquely colorable if it has just one coloring apart from permutations of colors. We characterize all uniquely colorable mixed hypergraphs of order n with X(H) = X(H) = n - 1 and n - 2. |
||||||
Cuvinte-cheie Edge-Colored Graph, Ramsey number, graph |
||||||
|