Color-Constrained Arborescences in Edge-Colored Digraphs

P. S. Ardra, Jasine Babu, R. Krithika +1

Given a multigraph $G$ whose edges are colored from the set $[q]:=\{1,2,\dots ,q\}$ (\emph{$q$-colored graph}), and a vector $\hat{I}\pm =(\hat{I}{\pm }_1,\dots ,\hat{I}{\pm }_q)\in {\mathbb{N}}^q$ (\emph{col…