Browsing Repositorio Ciencias by Subject "kernel-perfect digraph"

Now showing items 1-3 of 3

Kernels in pretransitive digraphs

Rojas-Monroy, R; Galeana-Sánchez, H (2004)

Let D be a digraph, V(D) and A(D) will denote the sets of vertices and arcs of D, respectively. A kernel N of D is an independent set of vertices such that for every w is an element of V(D) - N there exists an are from w ...
Kernels in quasi-transitive digraphs

Rojas-Monroy, R; Galeana-Sánchez, H (2006)

Let D be a digraph, V (D) and A (D) will denote the sets of vertices and arcs of D, respectively. A kernel N of D is an independent set of vertices such that for every w is an element of V (D) - N there exists an arc from ...
Monochromatic paths and at most 2-coloured arc sets in edge-coloured tournaments

Rojas-Monroy, R; Galeana-Sánchez, H (2005)

We call the tournament T an m-coloured tournament if the arcs of T are coloured with m-colours. If v is a vertex of an m- coloured tournament T, we denote by xi(v) the set of colours assigned to the arcs with v as an ...

Now showing items 1-3 of 3

Search DSpace