H-kernels by walks in an () digraph
Let be a digraph possibly with loops and a digraph without loops whose arcs are colored with the vertices of ( is said to be an -colored digraph). A directed walk in is said to be an -walk if and only if the consecutive colors encountered on form a directed walk in . A subset of the vertices of is s...
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
Taylor & Francis Group
2019-12-01
|
| Collection: | AKCE International Journal of Graphs and Combinatorics |
| Sujets: | |
| Accès en ligne: | http://dx.doi.org/10.1016/j.akcej.2019.02.009 |
| Tags: |
Pas de tags, Soyez le premier à ajouter un tag!
|