Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

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

Directed hypergraphs: a tool for researching digraphs and hypergraphs

100%

Galeana-Sánchez H., Manrique M.

Discussiones Mathematicae Graph Theory

2009

tom 29

nr 2

313-335

In this paper we introduce the concept of directed hypergraph. It is a generalisation of the concept of digraph and is closely related with hypergraphs. The basic idea is to take a hypergraph, partition its edges non-trivially (when possible), and give a total order to such partitions. The elements of these partitions are called levels. In order to preserve the structure of the underlying hypergraph, we ask that only vertices which belong to exactly the same edges may be in the same level of any edge they belong to. Some little adjustments are needed to avoid directed walks within a single edge of the underlying hypergraph, and to deal with isolated vertices. The concepts of independent set, absorbent set, and transversal set are inherited directly from digraphs. As a consequence of our results on this topic, we have found both a class of kernel-perfect digraphs with odd cycles and a class of hypergraphs which have a strongly independent transversal set.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Galeana-Sánchez H.

1 Manrique M.

1 2009

Wyniki wyszukiwania

Directed hypergraphs: a tool for researching digraphs and hypergraphs