On the Complexity of the 3-Kernel Problem in Some Classes of Digraphs
Let D be a digraph with the vertex set V (D) and the arc set A(D). A subset N of V (D) is k-independent if for every pair of vertices u, v ∈ N, we have d(u, v), d(v, u) ≥ k; it is l-absorbent if for every u ∈ V (D) − N there exists v ∈ N such that d(u, v) ≤ l. A k-kernel of D is a k-independent and...
Main Authors: | Hell Pavol, Hernández-Cruz César |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2014-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1727 |
Similar Items
-
(K − 1)-Kernels In Strong K-Transitive Digraphs
by: Wang Ruixia
Published: (2015-05-01) -
4-Transitive Digraphs I: The Structure of Strong 4-Transitive Digraphs
by: Hernández-Cruz César
Published: (2013-05-01) -
Kernels by Monochromatic Paths and Color-Perfect Digraphs
by: Galeana-Śanchez Hortensia, et al.
Published: (2016-05-01) -
Some Remarks On The Structure Of Strong K-Transitive Digraphs
by: Hernández-Cruz César, et al.
Published: (2014-11-01) -
Some Results on 4-Transitive Digraphs
by: García-Vázquez Patricio Ricardo, et al.
Published: (2017-02-01)