Title of article :
H-kernels by walks in subdivision digraph
Author/Authors :
Galeana-Sánchez, Hortensia Ciudad Universitaria - Coyoacán - Ciudad de México, México , Rojas-Monroy, Roc´ıo Universidad Autónoma del Estado de México - Estado de México , del Rocio Sanchez Lopez, Maria Department of Mathematics, Science Faculty, UNAM , Zavala-Santana, Berta Universidad Autónoma del Estado de México - Estado de México
Pages :
15
From page :
61
To page :
75
Abstract :
Let H be a digraph possibly with loops and D a digraph without loops whose arcs are colored with the vertices of H (D is said to be an H-colored digraph). A directed walk W in D is said to be an H-walk if and only if the consecutive colors encountered on W form a directed walk in H.
Keywords :
Kernel , Kernel by monochromatic paths , H-kernel by walks , subdivision digraph
Journal title :
Transactions on Combinatorics
Serial Year :
2020
Record number :
2605258
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=2605258
بازگشت