Kernels by monochromatic paths and color-perfect digraphs
Work
Year: 2015
Type: article
Abstract: For a digraph D, V (D) and A(D) will denote the sets of vertices and arcs of D respectively.In an arc-colored digraph, a subset K of V(D) is said to be kernel by monochromatic paths (mp-kernel) if (1)... more
Cites: 11
Cited by: 1
Related to: 10
FWCI:
Citation percentile (by year/subfield): 38.39
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond