Kernels by Monochromatic Paths and Color-Perfect Digraphs
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) for any two different vertices x, y in N there is no monochromatic directed path between them (N i...
| Published in: | Discussiones Mathematicae Graph Theory |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2016-05-01
|
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.1860 |