Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: co-strongly perfect graphs

Sortuj według:

Ogranicz wyniki do:

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

A note on strong and co-strong perfectness of the X-join of graphs

100%

Szelecka A., Włoch A.

Discussiones Mathematicae Graph Theory

1996

tom 16

nr 2

151-155

Strongly perfect graphs were introduced by C. Berge and P. Duchet in [1]. In [4], [3] the following was studied: the problem of strong perfectness for the Cartesian product, the tensor product, the symmetrical difference of n, n ≥ 2, graphs and for the generalized Cartesian product of graphs. Co-strong perfectness was first studied by G. Ravindra andD. Basavayya [5]. In this paper we discuss strong perfectness and co-strong perfectness for the generalized composition (the lexicographic product) of graphs named as the X-join of graphs.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Szelecka A.

1 Włoch A.

1 1996

Wyniki wyszukiwania

A note on strong and co-strong perfectness of the X-join of graphs