  We show, without using the Four Color Theorem, that for each planar
triangulation, the number of its proper vertex colorings by 4 colors is a
determinant and thus can be calculated in a polynomial time. In particular, we
can efficiently decide if the number is non-zero.
