Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: τ₁-construction

Sortuj według:

Ogranicz wyniki do:

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

KP-digraphs and CKI-digraphs satisfying the k-Meyniel's condition

100%

Galeana-Sánchez H., Neumann-Lara V.

Discussiones Mathematicae Graph Theory

1996

tom 16

nr 1

5-16

A digraph D is said to satisfy the k-Meyniel's condition if each odd directed cycle of D has at least k diagonals. The study of the k-Meyniel's condition has been a source of many interesting problems, questions and results in the development of Kernel Theory. In this paper we present a method to construct a large variety of kernel-perfect (resp. critical kernel-imperfect) digraphs which satisfy the k-Meyniel's condition.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Galeana-Sánchez H.

1 Neumann-Lara V.

1 1996

Wyniki wyszukiwania

KP-digraphs and CKI-digraphs satisfying the k-Meyniel's condition