Совершенные ориентационные раскраски кубических графов

In this work we extend concept of perfect coloring for directed graph. We use computer algorithm to get all allowable matrices of parameters for perfect orientation colorings of cubic graphs. For each matrix of parameters we show examples of coloring for corresponding minimal graphs.