Ориентированная раскраска плоских графов с обхватом не менее $4$

An oriented $k$-colouring of an oriented graph $H$ is a homomorphism of $H$ into a tournament on $k$ vertices. In the paper we prove that any orientation of a planar graph without triangle has an oriented $47$-colouring, which improves the best known upper bound $59$.