(A, ℬ)-kernels and Sands, Sauer and Woodrow’s theorem
Let D = (V(D), A(D)) a digraph. Consider the set PD= {P : P is a non trivial finite directed path in D} and let A and ℬ two subsets of PD. A subset N of V(D) is said to be an (A, ℬ)-kernel of D if (1) for every subset {u, v} of N there exists no uv-directed path P such that P∈A(N is A-independent) a...
Main Authors: | Hortensia Galeana-Sánchez, Rocío Rojas-Monroy, Rocío Sánchez-López |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2019-12-01
|
Series: | AKCE International Journal of Graphs and Combinatorics |
Online Access: | http://www.sciencedirect.com/science/article/pii/S0972860017301366 |
Similar Items
-
H-kernels by walks in an () digraph
by: Hortensia Galeana-Sánchez, et al.
Published: (2019-12-01) -
H-kernels by walks in an RH(D) digraph
by: Hortensia Galeana-Sánchez, et al.
Published: (2019-12-01) -
Kernels by Monochromatic Paths and Color-Perfect Digraphs
by: Galeana-Śanchez Hortensia, et al.
Published: (2016-05-01) -
H-kernels by walks in H-colored digraphs and the color-class digraph
by: Hortensia Galeana-Sánchez, et al.
Published: (2016-08-01) -
$H$-kernels by walks in subdivision digraph
by: Hortensia Galeana-Sánchez, et al.
Published: (2020-06-01)