| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 87 0 |
 SM ISO690:2012BACSO, Gabor, TUZA, Zsolt Czap, VOLOSHIN, Vitaly. Unique colorings of bi-hypergraphs. In: Australasian Journal of Combinatorics, 2003, vol. 27, pp. 33-45. ISSN 1034-4942. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
  Australasian Journal of Combinatorics |
||||||
| Volumul 27 / 2003 / ISSN 1034-4942 /ISSNe 2202-3518 | ||||||
|
||||||
| Pag. 33-45 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
We discuss the properties of uniform hypergraphs which have precisely one partition (i.e., a unique coloring apart from permutation of the colors) under the condition that in each edge, there exist three vertices which belong to precisely two classes of the partition. In particular, we investigate the relation between unique colorability, number of colors, and the cardinalities of color classes. |
||||||
| Cuvinte-cheie Edge-Colored Graph, Ramsey number, graph |
||||||
|
|
|
|
