AbstractIn this paper we present some results on the existence of k-kernels and (k, l)-kernels in digraphs which generalize the following Theorem of P. Duchet [2]: “If every directed cycle of odd length in a digraph D has at least two symmetrical arcs, then D has a kernel.
A kernel $J$ of a digraph $D$ is an independent set of vertices of $D$ such that for every vertex $w...
AbstractRichardson's theorem [4] asserts that if a digraph has no odd circuit, it possesses a kernel...
AbstractLet D be a finite digraph, V(D) and A(D) will denote the sets of vertices and arcs of D resp...
AbstractIn this paper we present some results on the existence of k-kernels and (k, l)-kernels in di...
In this paper, we prove the following sufficient condition for the existence of k-kernels in digraph...
The concept of (k,l)-kernels of digraphs was introduced in [2]. Next, H. Galeana-Sanchez [4] proved ...
A kernel N of a digraph D is an independent set of vertices of D such that for every w ∈ V (D)−N the...
AbstractA kernel N of a digraph D is an independent set of vertices of D such that for every w ∈ V(D...
AbstractA kernel N of a digraph D is an independent set of vertices of D such that for every x∈V(D)−...
In [5] the necessary and sufficient conditions for the existence of (k,l)-kernels in a D-join of dig...
Let D be a digraph. V(D) denotes the set of vertices of D; a set N ⊆ V(D) is said to be a k-kernel o...
Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (...
Let D be a digraph, V(D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (k...
AbstractLet D be a digraph, V(D) and A(D) will denote the sets of vertices and arcs of D, respective...
In the first part of this paper we give necessary and sufficient conditions for some special classes...
A kernel $J$ of a digraph $D$ is an independent set of vertices of $D$ such that for every vertex $w...
AbstractRichardson's theorem [4] asserts that if a digraph has no odd circuit, it possesses a kernel...
AbstractLet D be a finite digraph, V(D) and A(D) will denote the sets of vertices and arcs of D resp...
AbstractIn this paper we present some results on the existence of k-kernels and (k, l)-kernels in di...
In this paper, we prove the following sufficient condition for the existence of k-kernels in digraph...
The concept of (k,l)-kernels of digraphs was introduced in [2]. Next, H. Galeana-Sanchez [4] proved ...
A kernel N of a digraph D is an independent set of vertices of D such that for every w ∈ V (D)−N the...
AbstractA kernel N of a digraph D is an independent set of vertices of D such that for every w ∈ V(D...
AbstractA kernel N of a digraph D is an independent set of vertices of D such that for every x∈V(D)−...
In [5] the necessary and sufficient conditions for the existence of (k,l)-kernels in a D-join of dig...
Let D be a digraph. V(D) denotes the set of vertices of D; a set N ⊆ V(D) is said to be a k-kernel o...
Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (...
Let D be a digraph, V(D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (k...
AbstractLet D be a digraph, V(D) and A(D) will denote the sets of vertices and arcs of D, respective...
In the first part of this paper we give necessary and sufficient conditions for some special classes...
A kernel $J$ of a digraph $D$ is an independent set of vertices of $D$ such that for every vertex $w...
AbstractRichardson's theorem [4] asserts that if a digraph has no odd circuit, it possesses a kernel...
AbstractLet D be a finite digraph, V(D) and A(D) will denote the sets of vertices and arcs of D resp...
DOI
Add to ORKG