Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: induced-hereditary property of graphs

Sortuj według:

Ogranicz wyniki do:

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

On generating sets of induced-hereditary properties

100%

Semanišin G.

Discussiones Mathematicae Graph Theory

2002

tom 22

nr 1

183-192

A natural generalization of the fundamental graph vertex-colouring problem leads to the class of problems known as generalized or improper colourings. These problems can be very well described in the language of reducible (induced) hereditary properties of graphs. It turned out that a very useful tool for the unique determination of these properties are generating sets. In this paper we focus on the structure of specific generating sets which provide the base for the proof of The Unique Factorization Theorem for induced-hereditary properties of graphs.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Semanišin G.

1 2002

Wyniki wyszukiwania

On generating sets of induced-hereditary properties