H-kernels in unions of H-colored quasi-transitive digraphs
Work
Year: 2019
Type: article
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).For an arc (x, y) of D, its color is denoted... more
Institution Universidad Nacional Autónoma de México
Cites: 11
Cited by: 2
Related to: 10
FWCI: 0.33
Citation percentile (by year/subfield): 49.98
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Reduced inequalities
Open Access status: diamond