- Tytuł:
- About uniquely colorable mixed hypertrees
- Autorzy:
-
Niculitsa, Angela
Voloshin, Vitaly - Powiązania:
- https://bibliotekanauki.pl/articles/743697.pdf
- Data publikacji:
- 2000
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
colorings of graphs and hypergraphs
mixed hypergraphs
unique colorability
trees
hypertrees
elimination ordering - Opis:
- A mixed hypergraph is a triple = (X,,) where X is the vertex set and each of , is a family of subsets of X, the -edges and -edges, respectively. A k-coloring of is a mapping c: X → [k] such that each -edge has two vertices with the same color and each -edge has two vertices with distinct colors. = (X,,) is called a mixed hypertree if there exists a tree T = (X,) such that every -edge and every -edge induces a subtree of T. A mixed hypergraph is called uniquely colorable if it has precisely one coloring apart from permutations of colors. We give the characterization of uniquely colorable mixed hypertrees.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2000, 20, 1; 81-91
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł