Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: colorings of graphs and hypergraphs

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

About uniquely colorable mixed hypertrees

100%

Niculitsa A., Voloshin V.

Discussiones Mathematicae Graph Theory

2000

tom 20

nr 1

81-91

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.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Niculitsa A.

1 Voloshin V.

1 2000

Wyniki wyszukiwania

About uniquely colorable mixed hypertrees