Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: cost colouring

Sortuj według:

Ogranicz wyniki do:

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

Maximal hypergraphs with respect to the bounded cost hereditary property

100%

Drgas-Burchardt E., Fiedorowicz A.

Discussiones Mathematicae Graph Theory

2005

tom 25

nr 1-2

67-77

The hereditary property of hypergraphs generated by the cost colouring notion is considered in the paper. First, we characterize all maximal graphs with respect to this property. Second, we give the generating function for the sequence describing the number of such graphs with the numbered order. Finally, we construct a maximal hypergraph for each admissible number of vertices showing some density property. All results can be applied to the problem of information storage.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Drgas-Burchardt E.

1 Fiedorowicz A.

1 2005

Wyniki wyszukiwania

Maximal hypergraphs with respect to the bounded cost hereditary property