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.
AbstractA kernel N of a digraph D is an independent set of vertices of D such that for every w∈V(D)−...
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...
AbstractLet D be a finite digraph, V(D) and A(D) will denote the sets of vertices and arcs of D resp...
In this paper, we prove the following sufficient condition for the existence of k-kernels in digraph...
AbstractIn this paper we present some results on the existence of k-kernels and (k, l)-kernels in di...
AbstractA kernel N of a digraph D is an independent set of vertices of D such that for every w ∈ V(D...
AbstractA directed graph D with vertex set V is called cyclically h-partite (h⩾2) provided one can p...
The concept of (k,l)-kernels of digraphs was introduced in [2]. Next, H. Galeana-Sanchez [4] proved ...
Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (...
AbstractA kernel N of a digraph D is an independent set of vertices of D such that for every w ∈ V(D...
Let D be a digraph, V(D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (k...
A kernel N of a digraph D is an independent set of vertices of D such that for every w ∈ V (D)−N the...
AbstractLet D be a digraph, V(D) and A(D) will denote the sets of vertices and arcs of D, respective...
AbstractA diagraph D is said to be an R-digraph (kernel-perfect graph) if all of its induced subdigr...
AbstractA kernel N of a digraph D is an independent set of vertices of D such that for every x∈V(D)−...
AbstractA kernel N of a digraph D is an independent set of vertices of D such that for every w∈V(D)−...
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...
AbstractLet D be a finite digraph, V(D) and A(D) will denote the sets of vertices and arcs of D resp...
In this paper, we prove the following sufficient condition for the existence of k-kernels in digraph...
AbstractIn this paper we present some results on the existence of k-kernels and (k, l)-kernels in di...
AbstractA kernel N of a digraph D is an independent set of vertices of D such that for every w ∈ V(D...
AbstractA directed graph D with vertex set V is called cyclically h-partite (h⩾2) provided one can p...
The concept of (k,l)-kernels of digraphs was introduced in [2]. Next, H. Galeana-Sanchez [4] proved ...
Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (...
AbstractA kernel N of a digraph D is an independent set of vertices of D such that for every w ∈ V(D...
Let D be a digraph, V(D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (k...
A kernel N of a digraph D is an independent set of vertices of D such that for every w ∈ V (D)−N the...
AbstractLet D be a digraph, V(D) and A(D) will denote the sets of vertices and arcs of D, respective...
AbstractA diagraph D is said to be an R-digraph (kernel-perfect graph) if all of its induced subdigr...
AbstractA kernel N of a digraph D is an independent set of vertices of D such that for every x∈V(D)−...
AbstractA kernel N of a digraph D is an independent set of vertices of D such that for every w∈V(D)−...
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...
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