On list incidentor coloring of a multigraph of degree 3
A. V. Pyatkin · Journal of Applied and Industrial Mathematics · 2008
It is shown that if the number of colors in a list of each arc of a directed multigraph of degree 3 is at least the weight of this arc plus 3 then the incidentors of this multigraph can be colored according to these lists.